A Chromatic Metric on Graphs

Gerhard Benadé ()
Additional contact information
Gerhard Benadé: North-West University, School of Computer Science, Statistics and Mathematics

Chapter Chapter 13 in Structural Analysis of Complex Networks, 2011, pp 335-356 from Springer

Abstract: Abstract In this chapter, we introduce the concept of relatedness of graphs, based upon the generalized chromatic number. This allows the definition of a graph metric. It is proved that the distance between any two graphs is at most three.

Keywords: Graphs; Chromatic number; Generalized graph coloring; Graph distance; Metric (search for similar items in EconPapers)
Date: 2011
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-0-8176-4789-6_13

Ordering information: This item can be ordered from
http://www.springer.com/9780817647896

DOI: 10.1007/978-0-8176-4789-6_13

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().