On realizability of some graphs

DOI10.70013/3J5FKAAOMaRDI QIDQ7012255zbMATH OpenFDO

Authors Runze Wang

Publication date 17 March 2025

Published in CONTACT. Communications on Number Theory and Combinatorial Theory (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.70013/3J5FKAAO

zbMATH Keywords

cluster graphcomplete multipartite graphfriendship graphrealizable graph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Cites work

• A note on graphs whose neighborhoods are n-cycles
• Graphs whose neighborhoods have no special cycles
• scientific article; zbMATH DE number 6096647 (Why is no real title available?)
• scientific article; zbMATH DE number 15465 (Why is no real title available?)
• scientific article; zbMATH DE number 3641494 (Why is no real title available?)
• scientific article; zbMATH DE number 3240227 (Why is no real title available?)
• scientific article; zbMATH DE number 3260559 (Why is no real title available?)
• scientific article; zbMATH DE number 3407695 (Why is no real title available?)
• On graphs with a constant link. II
• Path-neighborhood graphs
• Terwilliger graphs in which the neighborhood of some vertex is isomorphic to a Petersen graph

This page was built for publication: On realizability of some graphs

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