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

DOI10.1016/j.akcej.2019.12.009zbMath1468.05186OpenAlexW3048195767MaRDI QIDQ5012380

S. Monikandan, N. Kalai Mathi

Publication date: 1 September 2021

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

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

zbMATH Keywords

cardreconstructionsplit graphsdeck

Mathematics Subject Classification ID

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

Related Items (1)

Nonsplit Graphs with Split Maximal Induced Subgraphs

Cites Work

• Degree associated edge reconstruction number of graphs
• The adversary degree-associated reconstruction number of double-brooms
• Degree-associated reconstruction parameters of complete multipartite graphs and their complements
• Degree-associated reconstruction number of graphs
• On a new digraph reconstruction conjecture
• Degree Associated Edge Reconstruction Number
• The graph reconstruction number
• The falsity of the reconstruction conjecture for tournaments
• The edge reconstruction number of a disconnected graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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