✦ LIBER ✦

On Group Connectivity of Graphs

✍ Scribed by Hong-Jian Lai; Rui Xu; Ju Zhou

Publisher: Springer Japan
Year: 2008
Tongue: English
Weight: 133 KB
Volume: 24
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-008-0780-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On recognition of finite simple groups w

On recognition of finite simple groups with connected prime graph

✍ A. V. Vasil’ev; I. B. Gorshkov 📂 Article 📅 2009 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 136 KB

On Connection Between the Structure of a

On Connection Between the Structure of a Finite Group and the Properties of Its Prime Graph

✍ A. V. Vasil’ev 📂 Article 📅 2005 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 214 KB

Group connectivity of complementary grap

Group connectivity of complementary graphs

✍ Xinmin Hou; Hong-Jian Lai; Ping Li; Cun-Quan Zhang 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 113 KB

## Abstract Let __G__ be a 2‐edge‐connected undirected graph, __A__ be an (additive) abelian group and __A__\* = __A__−{0}. A graph __G__ is __A__‐connected if __G__ has an orientation __D__(__G__) such that for every function __b__: __V__(__G__)↦__A__ satisfying , there is a function __f__: __E__(

Problem 141. : The genus of a Cayley gra

Problem 141. : The genus of a Cayley graph is the smallest genus of any surface on which the graph can be imbedded. The genus of a group G is the smallest genus of all connected Cayley graphs on G. Is it true that for each genus g, there is a group of genus g?

📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 69 KB

acceptable if they are not as widely known as they deserve.

Group connectivity and group colorings o

Group connectivity and group colorings of graphs — A survey

✍ Hong-Jian Lai; Xiangwen Li; Yehong Shao; Mingquan Zhan 📂 Article 📅 2010 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 469 KB

On local connectivity of graphs

✍ Lutz Volkmann 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 151 KB

The local connectivity κ(u, v) of two vertices u and v in a graph G is the maximum number of internally disjoint u-v paths in G, and the connectivity of G is defined as } for all pairs u and v of vertices in G. Let δ(G) be the minimum degree of G. We call a graph G maximally connected when κ(G) = δ