✦ LIBER ✦

Proof of conjectures on remoteness and proximity in graphs

✍ Scribed by Hua, Hongbo; Das, Kinkar Ch.

Book ID: 121690916
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 340 KB
Volume: 171
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2014.02.011

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Proximity and remoteness in graphs: Resu

Proximity and remoteness in graphs: Results and conjectures

✍ Mustapha Aouchiche; Pierre Hansen 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 138 KB

Nordhaus–Gaddum relations for proximity

Nordhaus–Gaddum relations for proximity and remoteness in graphs

✍ M. Aouchiche; P. Hansen 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 300 KB

The transmission of a vertex in a connected graph is the sum of all distances from that vertex to the others. It is said to be normalized if divided by n -1, where n denotes the order of the graph. The proximity of a graph is the minimum normalized transmission, while the remoteness is the maximum n

Proof of conjectures on adjacency eigenv

Proof of conjectures on adjacency eigenvalues of graphs

✍ Kinkar Ch. Das 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 279 KB

Proof of a conjecture on -tuple dominati

Proof of a conjecture on -tuple domination in graphs

✍ Guangjun Xu; Liying Kang; Erfang Shan; Hong Yan 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 142 KB

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

Proof of a conjecture on irredundance pe

Proof of a conjecture on irredundance perfect graphs

✍ Lutz Volkmann; Vadim E. Zverovich 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 157 KB 👁 1 views

## 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

Proof of a conjecture on cycles in a bip

Proof of a conjecture on cycles in a bipartite graph

✍ Wang, Hong 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 244 KB 👁 2 views

It was conjectured in [Wang, to appear in The Australasian Journal of Combinatorics] that, for each integer k ≥ 2, there exists . This conjecture is also verified for k = 2, 3 in [Wang, to appear; Wang, manuscript]. In this article, we prove this conjecture to be true if n ≥ 3k, i.e., M (k) ≤ 3k. W