Reconstruction number of separable self complementary graphs and others.

zbMATH Open1474.05283MaRDI QIDQ2829077FDOQ2829077

Authors: P. Bhanumathy, S. Ramachandran 

Publication date: 26 October 2016

Published in: Ars Combinatoria (Search for Journal in Brave)

Recommendations

• On separable self-complementary graphs
• Distance hereditary graphs \(G\) of connectivity two or three and \(\operatorname{diam} (G) = \operatorname{diam} (\overline{G}) = 3\) are reconstructible
• Two cases of reconstruction of separable graphs
• All graphs are set reconstructible if all 2-connected graphs are set reconstructible.
• Self-complementary graphs and Ramsey numbers. I: The decomposition and construction of self-complementary graphs

zbMATH Keywords

reconstruction numberself complementary graph

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph operations (line graphs, products, etc.) (05C76)

Cited In (3)

• Title not available (Why is that?)
• Are all pairs of hypomorphic digraphs \(S\)-isomorphic?
• A property of most of the known non-reconstructible digraphs

This page was built for publication: Reconstruction number of separable self complementary graphs and others.

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