On graphs isomorphic to their neighbour and non-neighbour sets

DOI10.1016/J.EJC.2009.12.004zbMATH Open1231.05180OpenAlexW1987809460MaRDI QIDQ976164FDOQ976164

Authors: Przemysław Gordinowicz 

Publication date: 17 June 2010

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2009.12.004

Recommendations

• scientific article; zbMATH DE number 5938867
• Constructing universal graphs for induced-hereditary graph properties
• Induced-hereditary graph properties, homogeneity, extensibility and universality
• On automorphisms of the countable p.e.c. graph
• Universality in graph properties with degree restrictions

zbMATH Keywords

construction of a universal countable graph

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• The search for N-e.c. Graphs
• Universal graphs and universal functions
• Asymmetric graphs
• Title not available (Why is that?)
• Research problems from the 18th British Combinatorial Conference
• Bounds and constructions for \(n\)-e.c. tournaments

Cited In (3)

• Die Anzahl nicht-isomorpher \(m\)-Graphen
• Isomorphism of graphs which are pairwise k-separable
• On automorphisms of the countable p.e.c. graph

This page was built for publication: On graphs isomorphic to their neighbour and non-neighbour sets

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