𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Monotonicity of (k;g,h)-graphs

✍ Scribed by Bao-guang Xu; Ping Wang; Jian-fang Wang

Book ID
106301549
Publisher
Institute of Applied Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year
2002
Tongue
English
Weight
95 KB
Volume
18
Category
Article
ISSN
0168-9673

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A characterization of graphs G with G β‰ˆ
A characterization of graphs G with G β‰ˆ K2(G)
✍ Chai-Ling Deng; Chong-Keang Lim πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 311 KB

A graph G is called a D-graph if for every set of cliques of G whose pairwise intersections are nonempty there is a vertex of G common to all the cliques of the set. A D-graph G is called a Dl-graph if it has the T 1 property: for any two distinct vertices x and y of G, there exist cliques C and D o

On the k-index of graphs
On the k-index of graphs
✍ Juraj BosΓ‘k πŸ“‚ Article πŸ“… 1971 πŸ› Elsevier Science 🌐 English βš– 540 KB

Almtngt. Gi~ a ter~ph, p~tn every two vt~rticet which me 5t a dhtance tugateΒ’ than a fixed intelget k t>l) by a new path of lenltth k. Thus a laaph tranlfor:nati~n ts defined. The least number of itaslttior~ of tht, tr;m~l'ofmalion Such that the last it~rJfion does not change the graph. et called th