Nonsplit Graphs with Split Maximal Induced Subgraphs

DOI10.22342/jims.29.2.988.217-234zbMath1530.05159OpenAlexW4388380155MaRDI QIDQ6154170

S. Monikandan, V. M. Manikandan

Publication date: 14 February 2024

Published in: Journal of the Indonesian Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.22342/jims.29.2.988.217-234

zbMATH Keywords

cyclesplit graphindependent setclique

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• The splittance of a graph
• Reconstruction of distance hereditary 2-connected graphs
• Split graphs
• Almost every graph has reconstruction number three
• The reconstruction conjecture is true if all 2-connected graphs are reconstructible
• The graph reconstruction number
• Split Graphs Having Dilworth Number Two
• Degree associated edge reconstruction number of split graphs with biregular independent set is one
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Nonsplit Graphs with Split Maximal Induced Subgraphs