Name
Abstract | ||
|---|---|---|
For given a graph H, a graphic sequence π = (d1, d 2,⋯, dn) is said to be potentially H-graphic if there is a realization of π containing H as a subgraph. In this paper, we characterize potentially K1,1,6-positive graphic sequences. This characterization implies the value of σ(K1,1,6,n). Moreover, we also give a simple sufficient condition for a positive graphic sequence π = (d1, d2,⋯, dn) to be potentially K 1,1,s-graphic for n ≥ s + 2 and a ≥ 2. |
Year | DOI | Venue |
|---|---|---|
2009 | null | Ars Comb. |
Keywords | DocType | Volume |
Degree sequence,Graph,Potentially K1,1,s-graphic sequence | Journal | 93 |
Issue | Citations | PageRank |
1 OCT. | 0 | 0.34 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Meng-Xiao Yin | 1 | 4 | 2.29 |
| Cheng Zhong | 2 | 117 | 22.02 |
| Feng Yang | 3 | 4 | 1.96 |