✦ LIBER ✦

On the minimum number of edges of two-connected graphs with given diameter

✍ Scribed by A. Jarry; A. Laugier

Book ID: 113567517
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 254 KB
Volume: 312
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2011.11.017

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Graphs of diameter 3 with the minimum nu

Graphs of diameter 3 with the minimum number of edges

✍ Zoltán Füredi 📂 Article 📅 1990 🏛 Springer Japan 🌐 English ⚖ 231 KB

Primitive graphs with given exponents an

Primitive graphs with given exponents and minimum number of edges

✍ Byeong Moon Kim; Byung Chul Song; Woonjae Hwang 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 364 KB

Maximum number of edges in connected gra

Maximum number of edges in connected graphs with a given domination number

✍ Laura A. Sanchis 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 519 KB

Sanchis, L.A., Maximum number of edges in connected graphs with a given domination number, Discrete Mathematics 87 (1991) 65-72.

Some results on characterizing the edges

Some results on characterizing the edges of connected graphs with a given domination number

✍ Laura A. Sanchis 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 821 KB

A dominatin# set for a graph G = (V, E) is a subset of vertices V' c\_ V such that for all v • V-V' there exists some u• V' for which {v,u} •E. The domination number of G is the size of its smallest dominating set(s). For a given graph G with minimum size dominating set D, let mz(G, D) denote the nu

Upper bound of the number of edges of a

Upper bound of the number of edges of a homogeneous connected hypergraph with a given diameter

✍ O. G. Rudenskaya 📂 Article 📅 1980 🏛 Springer US 🌐 English ⚖ 122 KB

Graphs on unlabelled nodes with a given

Graphs on unlabelled nodes with a given number of edges

✍ E. M. Wright 📂 Article 📅 1971 🏛 Springer Netherlands 🌐 English ⚖ 289 KB