✦ LIBER ✦

Some special minimum -geodetically connected graphs

✍ Scribed by Yingjie Lan; Songqing Chen

Book ID: 108112929
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 295 KB
Volume: 159
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2011.03.009

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimum 3-geodetically connected graphs

✍ Martina Bosı́ková 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 793 KB

A graph G is k-geodetically connected (k-GC) if it is connected and the removal of at least k vertices is required to increase the distance between at least one pair of vertices or reduce G to a single vertex. We completely characterize the class of minimum 3-GC graphs that have the fewest edges for

Towards minimum k-geodetically connected

Towards minimum k-geodetically connected graphs

✍ Ján Plesník 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 162 KB

Minimum k-geodetically connected digraph

Minimum k-geodetically connected digraphs

✍ Ján Plesník 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 192 KB

The recognition of geodetically connecte

The recognition of geodetically connected graphs

✍ Jou-Ming Chang; Chin-Wen Ho 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 849 KB

Let G = ( y E) be a graph with vertex set V of size n and edge set E of size m. A vertex LJ E V is called a hinge vertex if the distance of any two vertices becomes longer after u is removed. A graph without hinge vertex is called a hinge-free graph. In general, a graph G is k-geodetically connected

Geodetic connectivity of graphs

✍ Entringer, R.; Jackson, D.; Slater, P. 📂 Article 📅 1977 🏛 IEEE ⚖ 547 KB

Some minimum gossip graphs

✍ Roger Labahn 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 715 KB