𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A note on distance matrices with unicyclic graph realizations

✍ Scribed by J.M.S Simões-Pereira

Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
643 KB
Volume
65
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

We give necessary and sufficient conditions for a distance matrix to have a unicycfic graph as unique optimal graph realization.

📜 SIMILAR VOLUMES

A note on graphs with diameter-preservin
A note on graphs with diameter-preserving spanning trees
✍ Fred Buckley; Martin Lewinter 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 182 KB 👁 1 views

The distance between a pair of vertices u, u in a graph G is the length of a shortest path joining u and u. The diameter diam(G) of G is the maximum distance between all pairs of vertices in G. A spanning tree Tof G is diameter preserving if diam(T) = diam(G). In this note, we characterize graphs th

On the size of graphs labeled with a con
On the size of graphs labeled with a condition at distance two
✍ Georges, John P.; Mauro, David W. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 595 KB

A labeling of graph G with a condition at distance two is an integer labeling of V(G) such that adjacent vertices have labels that differ by at least two, and vertices distance two apart have labels that differ by a t least one. The lambda-number of G, A(G), is the minimum span over all labelings of

A note on minimal order of a bipartite g
A note on minimal order of a bipartite graph with exactly q quadrilaterals
✍ Mariusz Woźniak 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 206 KB

note on minimal order of a bipartite graph with exactly 4 quadrilaterals, Discrete Mathematics 121 (1993) 229-233. We show that the minimal order of a bipartite graph having exactly 4 quadrilaterals is asymptotically equal to 2fl $j (as 4 tends to infinity).