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 ArticleDOI
Algorithms to Find Geodetic Numbers and Edge Geodetic Numbers in Graphs
TL;DR: In this paper, the authors introduce the algorithms to find geodetic numbers and edge geodesic numbers in connected graphs using dynamic programming approach and introduce the algorithm to find the edge geodic cover of a graph G = (V, E).
Journal ArticleDOI
Wiener index of graphs with fixed number of pendant or cut-vertices
TL;DR: In this paper , the authors characterize the graphs which extremize the Wiener index among all graphs on $n$ vertices with $k$ pendant vertices, and also characterize the graph which minimizes theWiener index over the graphs on n$ vertice with $s$ cut vertices.
Posted Content
The average eccentricity of a graph with prescribed girth
TL;DR: In this article, the authors give upper bounds on the average eccentricity of a connected graph in terms of order n, minimum degree δ, and girth δ of the graph.
Proceedings ArticleDOI
Text format written questions evaluation Methodology
TL;DR: This paper presents a method to analyze students natural language text format written answers, to test questions and check its agreement with teacher s provided alternative answers, using graphics and techniques which will allow to assign values to concepts and relations.
Journal Article
• the edge –to–vertex monophonic number of a graph
J. John,K. Uma Samundesvari +1 more
TL;DR: In this paper, the edge-to-vertex monophonic number of a connected graph G = (V,E) is determined and some of its general properties are studied.