Algorithm for reconstruction number of split graphs

DOI10.1007/978-981-97-2066-8_5MaRDI QIDQ7032027zbMATH OpenFDO

Authors V. M. Manikandan, S. Monikandan

Publication date 5 February 2025

Full work available at URL https://doi.org/10.1007/978-981-97-2066-8_5

zbMATH Keywords

split graphcliqueindependent setreconstruction number

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Structural characterization of families of graphs (05C75) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites work

• scientific article; zbMATH DE number 17789 (Why is no real title available?)
• scientific article; zbMATH DE number 867654 (Why is no real title available?)
• scientific article; zbMATH DE number 2200042 (Why is no real title available?)
• scientific article; zbMATH DE number 3258862 (Why is no real title available?)
• A survey of some open questions in reconstruction numbers.
• Almost every graph has reconstruction number three
• Graph reconstruction—a survey
• Reconstruction number of graphs with unique pendant vertex
• Reconstruction of distance hereditary 2-connected graphs
• The graph reconstruction number

This page was built for publication: Algorithm for reconstruction number of split graphs

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