A proof for a conjecture on the Randić index of graphs with diameter
✍ Scribed by Jianxi Liu; Meili Liang; Bo Cheng; Bolian Liu
- Publisher
- Elsevier Science
- Year
- 2011
- Tongue
- English
- Weight
- 240 KB
- Volume
- 24
- Category
- Article
- ISSN
- 0893-9659
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## Abstract Let __ir__(__G__) and γ(__G__) be the irredundance number and the domination number of a graph __G__, respectively. A graph __G__ is called __irredundance perfect__ if __ir__(__H__)=γ(__H__), for every induced subgraph __H__ of __G__. In this article we present a result which immediatel
Let G = (V, E) be a graph and N G [v] the closed neighborhood of a vertex v in G. For k ∈ N, the minimum cardinality of a set In this note we prove the following conjecture of Rautenbach and Volkmann [D. Rautenbach, L. Volkmann, New bounds on the k-domination number and the k-tuple domination numbe