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
Topological analysis of some special classes of graphs. II: Steps, ladders, cylinders
Shyi-Long Lee,Yeong-Nan Yeh +1 more
TL;DR: In this article, a general strategy for generating the eigenvectors and eigenvalues of some special classes of graphs from the well-known chemical graphs such as lines and cycles which are isomorphic to the hydrogen-suppressed linear and cyclic polyenes is proposed.
Posted Content
Floodings of metric graphs
Krzysztof Burdzy,Soumik Pal +1 more
TL;DR: In this paper, the authors consider random labelings of finite graphs conditioned on a small fixed number of peaks and introduce a continuum framework where a combinatorial graph is associated with a metric graph and edges are identified with intervals.
The Rousseau number: an informetric version of the Erd\"os number
TL;DR: In this paper , an informetric equivalent of the Erdös number, called the Rousseau number, is presented, which is named in honor of Ronald Rousseau's 73 th birthday.
Journal ArticleDOI
The maximum girth and minimum circumference of graphs with prescribed radius and diameter
Pu Qiao,Xingzhi Zhan +1 more
TL;DR: This note improves on the obvious upper bound 2 d + 1 and implies that every Moore graph is self-centered and proves a property of the blocks of a graph which implies Hrnciar’s result.