Degree associated reconstruction number of graphs with regular pruned graph.

zbMATH Open1463.05380MaRDI QIDQ3134340FDOQ3134340

Authors: P. Anusha Devi, S. Monikandan 

Publication date: 9 February 2018

Recommendations

• Degree-associated reconstruction number of graphs
• Degree Associated Edge Reconstruction Number of Graphs with Regular Pruned Graph
• Degree associated reconstruction number of certain connected graphs with unique end vertex and a vertex of degree \(n-2\)
• Degree associated reconstruction number of split graphs with regular independent set
• Degree associated reconstruction number of graphs obtained by certain graph operations

zbMATH Keywords

isomorphismvertex-transitive graphcaterpillarreconstruction number

Mathematics Subject Classification ID

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

Cited In (11)

• Title not available (Why is that?)
• Degree associated reconstruction number of graphs obtained by certain graph operations
• Reconstruction number for Ulam's conjecture.
• Degree associated edge reconstruction number of split graphs with biregular independent set is one
• Degree associated reconstruction parameters of total graphs
• Degree associated reconstruction number of biregular bipartite graphs whose degrees differ by at least two
• Degree associated reconstruction number of split graphs with regular independent set
• Degree-associated edge-reconstruction numbers of double-brooms
• Degree-associated reconstruction number of graphs
• Degree associated reconstruction number of certain connected graphs with unique end vertex and a vertex of degree \(n-2\)
• Degree Associated Edge Reconstruction Number of Graphs with Regular Pruned Graph

This page was built for publication: Degree associated reconstruction number of graphs with regular pruned graph.

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