In a graph G, a k-insulated set S is a subset of the vertices of G such that every vertex in S is adjacent to at most k vertices in S, and every vertex outside S is adjacent to at least k + 1 vertices in S. The insulation sequence i0; i1; i2; : : : of a graph G is deΓΏned by setting i k equal to the
β¦ LIBER β¦
On the power sequence of a graph
β Scribed by A. Ramachandra Rao; S. B. Rao
- Book ID
- 112896331
- Publisher
- The Hebrew University Magnes Press
- Year
- 1970
- Tongue
- English
- Weight
- 202 KB
- Volume
- 8
- Category
- Article
- ISSN
- 0021-2172
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
The insulation sequence of a graph
β
Elena Grigorescu
π
Article
π
2004
π
Elsevier Science
π
English
β 419 KB
On the power sequence of a fuzzy matrix
β
Fan, Zhou -Tian ;Liu, De -Fu
π
Article
π
1997
π
Springer-Verlag
π
English
β 203 KB
On the Sequence of Closed-Set Lattices o
β
K. M. KOH; K. S. POH
π
Article
π
1989
π
John Wiley and Sons
π
English
β 283 KB
The chromatic difference sequence of a g
β
Michael O Albertson; David M Berman
π
Article
π
1980
π
Elsevier Science
π
English
β 713 KB
On the ultimate normalized chromatic dif
β
Huishan Zhou
π
Article
π
1996
π
Elsevier Science
π
English
β 489 KB
For graphs G and H, the Cartesian product G Γ H is defined as follows: the vertex set is ## V(G) Γ V(H), and two vertices (g,h) and (9',h') are adjacent in G Γ H if either g = g' and hh' E E(H) or h = h' and g9' E E(G). Let G k denote the Cartesian product of k copies of G. The chromatic differen
A note on diameter and the degree sequen
β
Simon Mukwembi
π
Article
π
2012
π
Elsevier Science
π
English
β 224 KB