✦ LIBER ✦

3-restricted connectivity of graphs with given girth

✍ Scribed by Li-tao Guo; Ji-xiang Meng

Book ID: 107500867
Publisher: SP Editorial Committee of Applied Mathematics - A Journal of Chinese Universities
Year: 2008
Tongue: English
Weight: 164 KB
Volume: 23
Category: Article
ISSN: 1005-1031
DOI: 10.1007/s11766-008-1908-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Connectivity of graphs with given girth

Connectivity of graphs with given girth pair

✍ C. Balbuena; M. Cera; A. Diánez; P. García-Vázquez; X. Marcote 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 171 KB

Graphs and digraphs with given girth and

Graphs and digraphs with given girth and connectivity

✍ Jiping Liu; ; Huishan Zhou 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 230 KB

In this paper, we show that for any given two positive integers g and k with g > 3, there exists a graph (digraph) G with girth g and connectivity k. Applying this result, we give a negative answer to the problem proposed by M. Junger, G. Reinelt and W.R Pulleyblank (1985).

Regular Graphs with Given Girth and Rest

Regular Graphs with Given Girth and Restricted Circuits

✍ Sachs, H. 📂 Article 📅 1963 🏛 Oxford University Press 🌐 English ⚖ 216 KB

Regular graphs with given girth pair

✍ Frank Harary; Peter Kovács 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 453 KB 👁 1 views

## Abstract The girth pair of a graph gives the length of a shortest odd and a shortest even cycle. The existence of regular graphs with given degree and girth pair is proved and simple bounds for their smallest order are developed. Several infinite classes of such graphs are constructed and it is

Unicyclic graphs of given girth having s

Unicyclic graphs of given girth having smallest general sum-connectivity index

✍ Tomescu, Ioan; Kanwal, Salma 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 369 KB

Graphs with given connectivity propertie

Graphs with given connectivity properties

✍ Lawrencenko, Serge; Luo, Qiang 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 98 KB

A node of a graph G, thought of as representing a communication network, is said to be redundant provided that its removal does not diminish the connectivity. In constructing networks, we require reliable connectedness in addition to the usual requirement of reliability (i.e., the higher the connect