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

Graph similarity and distance in graphs

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

DOI10.1007/s000100050025zbMath0889.05043OpenAlexW1997780247MaRDI QIDQ1381547

Gary Chartrand, Michelle Schultz, Grzegorz M. Kubicki

Publication date: 29 May 1998

Published in: Aequationes Mathematicae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s000100050025


zbMATH Keywords

bipartite graphdistance graphgraph distance


Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Distance in graphs (05C12)


Related Items (8)

Some measures of dissimilarity in intuitionistic fuzzy structures ⋮ Measuring similarity between connected graphs: the role of induced subgraphs and complementarity eigenvalues ⋮ On distance between graphs ⋮ Similarity in languages and programs ⋮ Filtered simplicial homology, graph dissimilarity and überhomology ⋮ The resistance perturbation distance: a metric for the analysis of dynamic networks ⋮ Dissimilarity measures between fuzzy sets or fuzzy structures. ⋮ Partial cubes are distance graphs




This page was built for publication: Graph similarity and distance in graphs

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