ISOLATED SCATTERING NUMBER OF SPLIT GRAPHS AND GRAPH PRODUCTS

DOI10.1017/S1446181117000062zbMath1373.90029MaRDI QIDQ5370790

Fengwei Li, Qingfang Ye, Xiaoyan Zhang

Publication date: 20 October 2017

Published in: The ANZIAM Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s1446181117000062

zbMATH Keywords

split graph; submodular function; Kronecker product; Cartesian product; isolated scattering number

Mathematics Subject Classification ID

05C90: Applications of graph theory

90B18: Communication networks in operations research

94C15: Applications of graph theory to circuits and networks

05C40: Connectivity

Related Items

Computing the weighted isolated scattering number of interval graphs in polynomial time

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Vertex vulnerability parameters of Kronecker products of complete graphs
• Geometric algorithms and combinatorial optimization
• The toughness of split graphs
• A finite automata approach to modeling the cross product of interconnection networks.
• A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
• Tough graphs and Hamiltonian circuits.
• Independent sets in tensor graph powers
• Split Graphs Having Dilworth Number Two
• On Maximal Circuits in Finite Graphs
• Computing the Scattering Number of Graphs
• Hypercubes As Direct Products
• Vulnerability parameters of split graphs
• Rupture degree of graphs