Degree associated reconstruction number of certain connected graphs with unique end vertex and a vertex of degree n−2

DOI10.1142/S1793830916500683zbMath1351.05153MaRDI QIDQ5298353

A. Anu, S. Monikandan

Publication date: 14 December 2016

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

zbMATH Keywords

reconstruction number\(P\)-graphseparable graph

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• 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 reconstruction conjecture is true if all 2-connected graphs are reconstructible
• Graph reconstruction—a survey

This page was built for publication: Degree associated reconstruction number of certain connected graphs with unique end vertex and a vertex of degree n−2