Group connectivity of graphs with diameter at most 2

DOI10.1016/J.EJC.2004.11.001MaRDI QIDQ820087zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Group connectivity of certain graphs
• Group connectivity of two kinds of graphs
• On group connectivity of graphs
• Connectedness of two-sided group digraphs and graphs
• Extremal 2-connected graphs with given diameter
• A sufficient condition on group connectivity of graphs
• Connected graphs of diameter two having small degree distances
• An extremal problem on group connectivity of graphs
• Group connectivity of Kneser graphs
• On the Diameter of a Graph Related to Conjugacy Classes of Groups

Cites work

• scientific article; zbMATH DE number 4075098 (Why is no real title available?)
• scientific article; zbMATH DE number 861308 (Why is no real title available?)
• A Contribution to the Theory of Chromatic Polynomials
• A reduction method to find spanning Eulerian subgraphs
• Decomposition of Finite Graphs Into Forests
• Extending a partial nowhere-zero 4-flow
• Graph theory
• Group connectivity of 3-edge-connected chordal graphs
• Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
• Nowhere‐zero 3‐flows in locally connected graphs
• Reduced graphs of diameter two
• There is No Irregular Moore Graph

Cited in

(14)

• A note on an extremal problem for group-connectivity
• The graphs that have antivoltages using groups of small order
• Nowhere-zero 3-flows and modulo \(k\)-orientations
• Group connectivity for \(K^{-k}_{m, n}\)
• An extremal problem on group connectivity of graphs
• Group connectivity and matchings
• A dual version of the brooks group coloring theorem
• The index problem of group connectivity
• Maximum degree condition and group connectivity
• Two equivalent properties of \(\mathcal Z_3\)-connectivity
• Group connectivity and group coloring: small groups versus large groups
• Group connectivity and group colorings of graphs --- a survey
• Degree sum and nowhere-zero 3-flows
• Degree conditions for group connectivity

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q820087)