Open AccessBook
Distance in graphs
Fred Buckley,Frank Harary +1 more
About:
The article was published on 1990-01-01 and is currently open access. It has received 1185 citations till now. The article focuses on the topics: Graph theory & Convexity.read more
Citations
More filters
Journal Article
• the upper edge-to-vertex geodetic number of a graph
J. John,Arun Vijayan,S. Sujitha +2 more
TL;DR: The concept of edge-to-vertex geodetic sets was introduced in this article for graphs with at least three vertices, where the minimum cardinality of a set of vertices is gev(G).
Posted Content
The Wiener Index of Unicyclic Graphs with Girth and the Matching Number
Ya-Hong Chen,Xiao-Dong Zhang +1 more
TL;DR: A sharp lower bound is presented for the Wiener index of unicyclic graphs of order n with girth and the matching number � � 3g 2 .
Journal ArticleDOI
More on Perfect Roman Domination in Graphs
TL;DR: In this article, the authors studied the perfect Roman domination number of graphs under some binary operation and showed that the minimum weight of a perfect Roman dominating function is the value ωG(f) = Pv∈V (G) f(v).
Journal ArticleDOI
On Independent Transversal Dominating Sets in Graphs
TL;DR: In this article, it was shown that for every positive integer a and b with 5 ≤ a ≤ b ≤ 2a − 2, there exists a connected graph G for which γit(G) = a and γitt(G), = b.
Journal ArticleDOI
The forcing connected detour number of a graph
TL;DR: In this article, the forcing connected detour number of a graph G is defined as the cardinality of a minimum forcing subset for a given subgraph S of G. The forcing subset of S is defined by the minimum ordering of its detour sets.