The Size of a Minimum Critically m-Neighbor-Scattered Graph

DOI10.1007/978-3-540-73556-4_12MaRDI QIDQ3611958zbMATH OpenOpenAlexFDO

Authors Fengwei Li, Qingfang Ye

Publication date 3 March 2009

Published in Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73556-4_12

Mathematics Subject Classification ID

Connectivity (05C40) Applications of graph theory (05C90) Deterministic network models in operations research (90B10)

Recommendations

• scientific article; zbMATH DE number 4158656
• General p-neighbor scattering number of graphs
• Scattering number in graphs
• The structure of max ?-minm?+1 graphs used in the design of reliable networks
• A polynomial algorithm of edge-neighbor-scattering number of trees

Cited in

(1)

• Neighbor Isolated Tenacity of Graphs

This page was built for publication: The Size of a Minimum Critically m-Neighbor-Scattered Graph

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