Abstract
A set D⊆V(G) is called a dominating set if N[v]∩D≠∅ for every vertex v in graph G. The domination number γ(G) is the minimum cardinality of a dominating set of G. The proximity π(v) of a vertex v is the average distance from it to all other vertices in graph. The remoteness ρ(G) of a connected graph G is the maximum proximity of all the vertices in graph G. AutoGraphiX Conjecture A.565 gives the sharp upper bound on the difference between the domination number and remoteness. In this paper, we characterize the explicit graphs that attain the upper bound in the above conjecture, and prove the improved AutoGraphiX conjecture.
Funder
National Natural Science Foundation of China
Natural Science Research for Colleges and Universities of Anhui Province
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)