Domination and independence number of large 2-crossing-critical graphs

2022/03/23 by Vesna Iršič, Iršič, Vesna, Maruša Lekše +7
Computer Science · Materials Science · #Advanced Graph Theory Research #Interconnection Networks and Systems #Carbon and Quantum Dots Applications

paper · pdf · doi:10.48550/arxiv.2203.12206

Abstract

After 2-crossing-critical graphs were characterized in 2016, their most general subfamily, large 3-connected 2-crossing-critical graphs, has attracted separate attention. This paper presents sharp upper and lower bounds for their domination and independence number.

Related

• Properties of Large 2-Crossing-Critical Graphs
• New upper bounds for the crossing numbers of crossing-critical graphs
• Characterizing 2-crossing-critical graphs
• A new infinite family of 4-regular crossing-critical graphs
• Improvement on the crossing number of crossing-critical graphs