Group connectivity of graphs with diameter at most 2
From MaRDI portal
Publication:820087
DOI10.1016/J.EJC.2004.11.001zbMATH Open1094.05029OpenAlexW2155060804MaRDI QIDQ820087FDOQ820087
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
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
- Graph theory
- A Contribution to the Theory of Chromatic Polynomials
- A reduction method to find spanning Eulerian subgraphs
- Decomposition of Finite Graphs Into Forests
- Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
- Group connectivity of 3-edge-connected chordal graphs
- Title not available (Why is that?)
- Extending a partial nowhere-zero 4-flow
- Nowhere‐zero 3‐flows in locally connected graphs
- There is No Irregular Moore Graph
- Title not available (Why is that?)
- Reduced graphs of diameter two
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)