✦ LIBER ✦

Augmenting Graphs to Minimize the Diameter

✍ Scribed by Frati, Fabrizio; Gaspers, Serge; Gudmundsson, Joachim; Mathieson, Luke

Book ID: 125348021
Publisher: Springer
Year: 2014
Tongue: English
Weight: 534 KB
Volume: 72
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-014-9886-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The parametric complexity of graph diame

The parametric complexity of graph diameter augmentation

✍ Gao, Yong; Hare, Donovan R.; Nastos, James 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 383 KB

Graphs with diameter minimizing the spec

Graphs with diameter minimizing the spectral radius

✍ Jingfen Lan; Linyuan Lu; Lingsheng Shi 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 702 KB

Minimizing the Oriented Diameter of a Pl

Minimizing the Oriented Diameter of a Planar Graph

✍ Nicole Eggemann; Steven D. Noble 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 182 KB

Minimizing and maximizing the diameter i

Minimizing and maximizing the diameter in orientations of graphs

✍ G. Gutin 📂 Article 📅 1994 🏛 Springer Japan 🌐 English ⚖ 256 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

Size in maximal triangle-free graphs and

Size in maximal triangle-free graphs and minimal graphs of diameter 2

✍ Curtiss Barefoot; Karen Casey; David Fisher; Kathryn Fraughnaugh; Frank Harary 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 290 KB

A triangle-free graph is maximal if the addition of any edge creates a triangle. For n ~> 5, we show there is an n-node m-edge maximal triangle-free graph if and only if it is complete bipartite or 2n-5<<.m<<.L(n-1)2/4J+l. A diameter 2 graph is minimal if the deletion of any edge increases the diame