Group connectivity of two kinds of graphs

MaRDI QIDQ3629056zbMATH OpenFDO

Authors Xiangjuan Yao

Publication date 26 May 2009

Full work available at URL http://www.m-hikari.com/ija/ija-password-2008/ija-password17-20-2008/index.html

zbMATH Keywords

undirected graphgroup 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 in products of graphs
• Group connectivity for \(K^{-k}_{m, n}\)
• Group connectivity of generalized q-trees
• Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties

Cited in

(16)

• On group hypo-connected graphs
• Group connectivity of complementary graphs
• Group connectivity of graphs with diameter at most 2
• The Chvátal-Erdős condition for group connectivity in graphs
• Group connectivity for \(K^{-k}_{m, n}\)
• scientific article; zbMATH DE number 1472119 (Why is no real title available?)
• A dual version of the brooks group coloring theorem
• Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
• Group connectivity of certain graphs
• Group connectivity of Kneser graphs
• Component Connectivity of Alternating Group Networks and Godan Graphs
• Group connectivity of bridged graphs
• Group connectivity in products of graphs
• Group connectivity of semistrong product of graphs
• Degree conditions for group connectivity
• Group connectivity of generalized q-trees

This page was built for publication: Group connectivity of two kinds of graphs

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