Degree associated edge reconstruction number of split graphs with biregular independent set is one

DOI10.1016/J.AKCEJ.2019.12.009MaRDI QIDQ5012380zbMATH OpenOpenAlexFDO

Authors N. Kalai Mathi, S. Monikandan

Publication date 1 September 2021

Published in AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1016/j.akcej.2019.12.009

zbMATH Keywords

carddeckreconstructionsplit graphs

Mathematics Subject Classification ID

Vertex degrees (05C07) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Recommendations

• Degree associated edge reconstruction number of split graphs with regular independent set is one or two
• Degree associated reconstruction number of split graphs with regular independent set
• Nearly all biregular graphs have degree associated edge reconstruction number at most three.
• Degree associated edge reconstruction number
• Degree associated edge reconstruction number of graphs

Cites work

• A survey of some open questions in reconstruction numbers.
• Degree associated edge reconstruction number
• Degree associated edge reconstruction number of graphs
• Degree associated edge reconstruction number of split graphs with regular independent set is one or two
• Degree associated reconstruction number of graphs with regular pruned graph.
• Degree-associated reconstruction number of graphs
• Degree-associated reconstruction parameters of complete multipartite graphs and their complements
• Graph reconstruction conjecture: reductions using complement, connectivity and distance
• scientific article; zbMATH DE number 3141308 (Why is no real title available?)
• scientific article; zbMATH DE number 4097430 (Why is no real title available?)
• scientific article; zbMATH DE number 3674136 (Why is no real title available?)
• scientific article; zbMATH DE number 17789 (Why is no real title available?)
• scientific article; zbMATH DE number 3258862 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• On a new digraph reconstruction conjecture
• Reconstruction number for Ulam's conjecture.
• The adversary degree-associated reconstruction number of double-brooms
• The edge reconstruction number of a disconnected graph
• The falsity of the reconstruction conjecture for tournaments
• The graph reconstruction number

Cited in

(5)

• Degree associated reconstruction number of split graphs with regular independent set
• Nearly all biregular graphs have degree associated edge reconstruction number at most three.
• Degree Associated Edge Reconstruction Number of Graphs with Regular Pruned Graph
• Degree associated edge reconstruction number of split graphs with regular independent set is one or two
• Nonsplit Graphs with Split Maximal Induced Subgraphs

This page was built for publication: Degree associated edge reconstruction number of split graphs with biregular independent set is one

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