A note on an extremal problem for group-connectivity

DOI10.1016/J.EJC.2014.03.002MaRDI QIDQ402471zbMATH OpenOpenAlexFDO

Authors Rong Luo, Cun-Quan Zhang, Dong Ye, Yezhou Wu

Publication date 28 August 2014

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

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

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Connectivity (05C40)

Recommendations

• An extremal problem on group connectivity of graphs
• On group connectivity of graphs
• scientific article; zbMATH DE number 867714
• scientific article; zbMATH DE number 750968
• An extremal problem on the connectivity of graphs
• A sufficient condition on group connectivity of graphs
• Group connectivity of certain graphs
• On a problem about the connectivity of the proper enhanced power graph of a finite group
• Applying extremal graph theory to a question on finite groups
• scientific article; zbMATH DE number 4130402

Cites work

• scientific article; zbMATH DE number 1146235 (Why is no real title available?)
• A Contribution to the Theory of Chromatic Polynomials
• An extremal problem on group connectivity of graphs
• Degree sum condition for \(Z_{3}\)-connectivity in graphs
• Group connectivity and group colorings of graphs --- a survey
• Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
• Group connectivity of graphs with diameter at most 2
• Nowhere-zero 3-flows and modulo \(k\)-orientations
• Nowhere-zero 4-flows; simultaneous edge-colorings; and critical partial Latin squares
• Ore-condition and \(Z_3\)-connectivity
• Realizing Degree Sequences with Graphs Having Nowhere-Zero 3-Flows
• Research problems
• The weak 3-flow conjecture and the weak circular flow conjecture

Cited in

(7)

• The sum necessary to ensure that a degree sequence pair has an \(a\)-connected realization
• Modulo 5-orientations and degree sequences
• An extremal problem on group connectivity of graphs
• A complete characterization of graphic sequences with a \(Z_3\)-connected realization
• Bigraphic pairs with an A-connected realization
• Group connectivity: \(\mathbb{Z}_4\) vs \(\mathbb{Z}_2^2\)
• Group Connectivity, Strongly Z_m-Connectivity, and Edge Disjoint Spanning Trees

This page was built for publication: A note on an extremal problem for group-connectivity

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