Hits:
Indexed by:期刊论文
Date of Publication:2013-04-01
Journal:ARS COMBINATORIA
Included Journals:SCIE、Scopus
Volume:109
Page Number:113-128
ISSN No.:0381-7032
Key Words:Prime labeling; Prime graph; Knodel graph
Abstract:A graph G with vertex set V is said to have a prime labeling if its vertices can be labeled with distinct integers 1, 2, . . . , vertical bar V vertical bar such that for every edge xy in E, the labels assigned to x and y are relatively prime or coprime. In this paper, we show that the Knodel graph W-3,W-n is prime for n <= 130.
Pre One:Stable lsotope-Assisted Lipidomics Combined with Nontargeted lsotopomer Filtering, a Tool to Unravel the Complex Dynamics of Lipid Metabolism
Next One:A support vector machine-recursive feature elimination feature selection method based on artificial contrast variables and mutual information
