✦ LIBER ✦

Minimizing the Oriented Diameter of a Planar Graph

✍ Scribed by Nicole Eggemann; Steven D. Noble

Book ID: 108120709
Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 182 KB
Volume: 34
Category: Article
ISSN: 1571-0653
DOI: 10.1016/j.endm.2009.07.043

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimizing and maximizing the diameter i

Minimizing and maximizing the diameter in orientations of graphs

✍ G. Gutin 📂 Article 📅 1994 🏛 Springer Japan 🌐 English ⚖ 256 KB

Oriented diameter of graphs with diamete

Oriented diameter of graphs with diameter 3

✍ Peter K. Kwok; Qi Liu; Douglas B. West 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 226 KB

Maximal planar graphs of diameter two

✍ Karen Seyffarth 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 1020 KB

A maximal planar graph is a simple planar graph in which every face is a triangle. We show here that such graphs with maximum degree A and diameter two have no more than :A + 1 vertices. We also show that there exist maximal planar graphs with diameter two and exactly LiA + 1 J vertices.

Minimal energy of unicyclic graphs of a

Minimal energy of unicyclic graphs of a given diameter

✍ Feng Li; Bo Zhou 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 150 KB

The minimal spectral radius of graphs wi

The minimal spectral radius of graphs with a given diameter

✍ E.R. van Dam; R.E. Kooij 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 228 KB

The diameter of an orientation of a comp

The diameter of an orientation of a complete multipartite graph

✍ K.M. Koh; B.P. Tan 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 390 KB

For a graph G, let e(G) denote the minimum value of the diameters diamD of D, where D runs through all the orientations of G. In this paper, we obtain some results on e(G) for complete multipartite graphs G, which extend some known results due to Boesch and Tindell [1] and Maurer [4].