An upper bound for neighbor-connectivity of graphs

DOI10.1007/S10878-024-01235-6MaRDI QIDQ7031270zbMATH OpenFDO

Authors Hongliang Ma, Baoyindureng Wu

Publication date 6 February 2025

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10878-024-01235-6

zbMATH Keywords

neighbor-connectivityproduct graphstriangle-free graphs

Mathematics Subject Classification ID

Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)

Cites work

• A group-theoretic model for symmetric interconnection networks
• A new bound for neighbor-connectivity of abelian Cayley graphs
• Bounding neighbor-connectivity of Abelian Cayley graphs
• Bounds for sorting by prefix reversal
• Cayley Graphs with Neighbor Connectivity One
• Graph theory
• scientific article; zbMATH DE number 3628999 (Why is no real title available?)
• Neighbor connectivity of \(k\)-ary \(n\)-cubes
• Neighbor connectivity of pancake graphs and burnt pancake graphs
• Neighbor connectivity of two kinds of Cayley graphs
• Neighbor-connected graphs and projective planes
• Neighbor-connectivity of pancake networks and burnt pancake networks
• Neighbour-connectivity in regular graphs

Cited in

(1)

• Neighbor connectivity of bubble-sort star graphs

This page was built for publication: An upper bound for neighbor-connectivity of graphs

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