Group connectivity of graphs with diameter at most 2

DOI10.1016/j.ejc.2004.11.001zbMath1094.05029OpenAlexW2155060804MaRDI QIDQ820087

Hong-Jian Lai, Xiangjuan Yao

Publication date: 6 April 2006

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2004.11.001

zbMATH Keywords

group connectivity number

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Connectivity (05C40)

Related Items (11)

Two equivalent properties of \(\mathcal Z_3\)-connectivity ⋮ A note on an extremal problem for group-connectivity ⋮ Group connectivity and group colorings of graphs --- a survey ⋮ An extremal problem on group connectivity of graphs ⋮ A dual version of the brooks group coloring theorem ⋮ Nowhere-zero 3-flows and modulo \(k\)-orientations ⋮ Degree conditions for group connectivity ⋮ Degree sum and nowhere-zero 3-flows ⋮ Maximum degree condition and group connectivity ⋮ Group connectivity and group coloring: small groups versus large groups ⋮ Group connectivity and matchings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
• Group connectivity of 3-edge-connected chordal graphs
• Reduced graphs of diameter two
• A reduction method to find spanning Eulerian subgraphs
• Extending a partial nowhere-zero 4-flow
• Nowhere‐zero 3‐flows in locally connected graphs
• There is No Irregular Moore Graph
• Decomposition of Finite Graphs Into Forests
• A Contribution to the Theory of Chromatic Polynomials

This page was built for publication: Group connectivity of graphs with diameter at most 2