Highly irregular graph

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

In graph theory, a highly irregular graph is a graph in which, for every vertex, all neighbors of that vertex have distinct degrees.

History[edit]

Irregular graphs were initially characterized by Yousef Alavi, Gary Chartrand, Fan Chung, Paul Erdős, Ronald Graham, and Ortrud Oellermann.[1] They were motivated to define the ‘opposite’ of a regular graph, a concept which has been thoroughly studied and well understood.

Locality and regularity[edit]

Defining an ‘irregular graph’ was not immediately obvious. In a k-regular graph, all vertices have degree k. In any graph G, two vertices in G must have the same degree, so an irregular graph cannot be defined as a graph with all vertices of different degrees. One may be tempted then to define an irregular graph as having all vertices of distinct degrees except for two, but these types of graphs are also well understood and thus not interesting.[2]

Graph theorists thus turned to the issue of local regularity. A graph is locally regular at a vertex v if all vertices adjacent to v have degree r. A graph is thus locally irregular if for each vertex v of G the neighbors of v have distinct degrees, and these graphs are thus termed highly irregular graphs.[1]

Properties of irregular graphs[edit]

Some facts about highly irregular graphs outlined by Alavi et al.:[3]

  • If v is a vertex of maximum degree d in a highly irregular graph H, then v is adjacent to exactly one vertex of degree 1, 2, ..., d.[3]
  • The largest degree in a highly irregular graph is at most half the number of vertices.[3]
  • If H is a highly irregular graph with maximum degree d, one can construct a highly irregular graph of degree d+1 by taking two copies of H and adding an edge between the two vertices of degree d.[3]
  • H(n)/G(n) goes to 0 as n goes to infinity exponentially rapidly, where H(n) is the number of (non-isomorphic) highly irregular graphs with n vertices, and G(n) is the total number of graphs with n vertices.[3]
  • For every graph G, there exists a highly irregular graph H containing G as an induced subgraph.[3]

This last observation can be considered analogous to a result of Dénes Kőnig, which states that if H is a graph with greatest degree r, then there is a graph G which is r-regular and contains H as an induced subgraph.[3]

Applications of irregularity[edit]

Definitions of irregularity have been important in the study of network heterogeneity, which has implications in networks found across biology, ecology, technology, and economy.[4] There have been several graph statistics that have been suggested, many of which are based on the number of vertices in a graph and their degrees. The characterization of highly irregular graphs has also been applied to the question of heterogeneity, yet all of these fail to shed enough light on real-world situations. Efforts continue to be made to find appropriate ways to quantify network heterogeneity.[4]

References[edit]

  1. ^ a b [1] Chartrand, Gary, Paul Erdos, and Ortrud R. Oellermann. "How to define an irregular graph." College Math. J 19.1 (1988): 36–42.
  2. ^ Behzad, Mehdi, and Gary Chartrand. "No graph is perfect." American Mathematical Monthly (1967): 962–963.
  3. ^ a b c d e f g [2] Alavi, Yousef, et al. "Highly irregular graphs." Journal of graph theory 11.2 (1987): 235–249.
  4. ^ a b [3] Estrada, Ernesto. "Quantifying network heterogeneity." Physical Review E 82.6 (2010): 066102.