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
On the extremal properties of the average eccentricity
TL;DR: In this article, the authors analyze extremal properties of the average eccentricity, and introduce two graph transformations that increase or decrease the eccentricity of a given graph, and resolve four conjectures obtained by the system AutoGraphiX.
Journal ArticleDOI
Hosoya polynomial of composite graphs
TL;DR: This paper generalizes Yeh and Gutman's results to compute the Hosoya polynomial of these graphs and calculates the Wiener number of these composite graphs.
Journal ArticleDOI
Computing the Eccentricity Distribution of Large Graphs
Frank W. Takes,Walter A. Kosters +1 more
TL;DR: An exact algorithm based on eccentricity lower and upper bounds is proposed, which achieves significant speedups compared to the straightforward algorithm when computing both the extreme values of the distribution as well as the eccentricity distribution as a whole.
Journal ArticleDOI
Additively weighted Harary index of some composite graphs
TL;DR: A modification of the Harary index in which the contributions of vertex pairs are weighted by the sum of their degrees is introduced, finding the extremal graphs and investigating its behavior under several standard graph products.
Proceedings Article
Mining association rules in hypertext databases
José Borges,Mark Levene +1 more
TL;DR: The concepts of confidence and support for composite association rules, and two algorithms to mine such rules are proposed, show that, in spite of the worst-case complexity analysis which indicates exponential behaviour, in practice the algorithms' complexity is linear in the number of nodes traversed.