Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

On distance between graphs

From MaRDI portal
Publication:367064
Jump to:navigation, search

DOI10.1007/S00373-012-1213-8zbMath1272.05038OpenAlexW2044481072MaRDI QIDQ367064

Alexander Halperin, Daniel M. Martin, Colton Magnant

Publication date: 26 September 2013

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-012-1213-8


zbMATH Keywords

hypercubebipartite graphdistance graphgraph isomorphism


Mathematics Subject Classification ID

Distance in graphs (05C12) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Density (toughness, etc.) (05C42)





Cites Work

  • Unnamed Item
  • Graph similarity and distance in graphs
  • Partial cubes are distance graphs




This page was built for publication: On distance between graphs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:367064&oldid=12239942"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 02:58.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki