Degree () From Wikipedia, the free encyclopedia Contents

1 Degree (graph theory) 1 1.1 Handshaking lemma ...... 1 1.2 Degree sequence ...... 2 1.3 Special values ...... 3 1.4 Global properties ...... 3 1.5 See also ...... 4 1.6 Notes ...... 4 1.7 References ...... 4

2 Graph operations 5 2.1 Unary operations ...... 5 2.1.1 Elementary operations ...... 5 2.1.2 Advanced operations ...... 5 2.2 Binary operations ...... 5 2.3 Notes ...... 6

3 Regular graph 7 3.1 Existence ...... 7 3.2 Algebraic properties ...... 7 3.3 Generation ...... 8 3.4 See also ...... 8 3.5 References ...... 8 3.6 External links ...... 8 3.7 Text and image sources, contributors, and licenses ...... 9 3.7.1 Text ...... 9 3.7.2 Images ...... 9 3.7.3 Content license ...... 9

i Chapter 1

Degree (graph theory)

A graph with vertices labeled by degree

In graph theory, the degree (or valency) of a vertex of a graph is the number of edges incident to the vertex, with loops counted twice.[1] The degree of a vertex v is denoted deg(v) or deg v . The maximum degree of a graph G, denoted by Δ(G), and the minimum degree of a graph, denoted by δ(G), are the maximum and minimum degree of its vertices. In the graph on the right, the maximum degree is 5 and the minimum degree is 0. In a regular graph, all degrees are the same, and so we can speak of the degree of the graph.

1.1 Handshaking lemma

Main article: handshaking lemma

The degree sum formula states that, given a graph G = (V,E) ,

∑ deg(v) = 2|E| . v∈V

1 2 CHAPTER 1. DEGREE (GRAPH THEORY)

The formula implies that in any graph, the number of vertices with odd degree is even. This statement (as well as the degree sum formula) is known as the handshaking lemma. The latter name comes from a popular mathematical problem, to prove that in any of people the number of people who have shaken hands with an odd number of other people from the group is even.

1.2 Degree sequence

Two non-isomorphic graphs with the same degree sequence (3, 2, 2, 2, 2, 1, 1, 1).

The degree sequence of an undirected graph is the non-increasing sequence of its vertex degrees;[2] for the above graph it is (5, 3, 3, 2, 2, 1, 0). The degree sequence is a graph invariant so isomorphic graphs have the same degree sequence. However, the degree sequence does not, in general, uniquely identify a graph; in some cases, non-isomorphic graphs have the same degree sequence. The degree sequence problem is the problem of finding some or all graphs with the degree sequence being a given non-increasing sequence of positive integers. (Trailing zeroes may be ignored since they are trivially realized by adding an appropriate number of isolated vertices to the graph.) A sequence which is the degree sequence of some graph, i.e. for which the degree sequence problem has a solution, is called a graphic or graphical sequence. As a consequence of the degree sum formula, any sequence with an odd sum, such as (3, 3, 1), cannot be realized as the degree sequence of a graph. The converse is also true: if a sequence has an even sum, it is the degree sequence 1.3. SPECIAL VALUES 3 of a multigraph. The construction of such a graph is straightforward: connect vertices with odd degrees in pairs by a matching, and fill out the remaining even degree counts by self-loops. The question of whether a given degree sequence can be realized by a simple graph is more challenging. This problem is also called graph realization problem and can either be solved by the Erdős–Gallai theorem or the Havel–Hakimi algorithm. The problem of finding or estimating the number of graphs with a given degree sequence is a problem from the field of graph enumeration.

1.3 Special values

An undirected graph with leaf nodes 4, 5, 6, 7, 10, 11, and 12

• A vertex with degree 0 is called an isolated vertex.

• A vertex with degree 1 is called a leaf vertex or end vertex, and the edge incident with that vertex is called a pendant edge. In the graph on the right, {3,5} is a pendant edge. This terminology is common in the study of trees in graph theory and especially trees as data structures.

• A vertex with degree n − 1 in a graph on n vertices is called a dominating vertex.

1.4 Global properties

• If each vertex of the graph has the same degree k the graph is called a k-regular graph and the graph itself is said to have degree k. Similarly, a bipartite graph in which every two vertices on the same side of the bipartition as each other have the same degree is called a biregular graph.

• An undirected, connected graph has an Eulerian path if and only if it has either 0 or 2 vertices of odd degree. If it has 0 vertices of odd degree, the Eulerian path is an Eulerian circuit.

• A directed graph is a pseudoforest if and only if every vertex has outdegree at most 1. A functional graph is a special case of a pseudoforest in which every vertex has outdegree exactly 1. 4 CHAPTER 1. DEGREE (GRAPH THEORY)

• By Brooks’ theorem, any graph other than a or an odd cycle has chromatic number at most Δ, and by Vizing’s theorem any graph has chromatic index at most Δ + 1. • A k-degenerate graph is a graph in which each subgraph has a vertex of degree at most k.

1.5 See also

• Indegree, outdegree for digraphs

• Degree distribution • degree sequence for bipartite graphs

1.6 Notes

[1] Diestel p.5

[2] Diestel p.278

1.7 References

• Diestel, Reinhard (2005), Graph Theory (3rd ed.), , New York: Springer-Verlag, ISBN 978-3-540- 26183-4.

• Erdős, P.; Gallai, T. (1960), “Gráfok előírt fokszámú pontokkal” (PDF), Matematikai Lapok (in Hungarian) 11: 264–274.

• Havel, Václav (1955), “A remark on the existence of finite graphs”, Časopis pro pěstování matematiky (in Czech) 80: 477–480

• Hakimi, S. L. (1962), “On realizability of a set of integers as degrees of the vertices of a linear graph. I”, Journal of the Society for Industrial and Applied Mathematics 10: 496–506, MR 0148049.

• Sierksma, Gerard; Hoogeveen, Han (1991), “Seven criteria for integer sequences being graphic”, Journal of Graph Theory 15 (2): 223–231, doi:10.1002/jgt.3190150209, MR 1106533. Chapter 2

Graph operations

Operations on graphs produce new graphs from old ones. They may be separated into the following major cate- gories.

2.1 Unary operations

Unary operations create a new graph from the old one.

2.1.1 Elementary operations

These are sometimes called “editing operations” on graphs. They create a new graph from the original one by a simple, local change, such as addition or deletion of a vertex or an edge, merging and splitting of vertices, edge contraction, etc.

2.1.2 Advanced operations

• Transpose graph • Complement graph • Line graph • Graph minor • Power of graph: The k-th power Gk of a graph G is a supergraph formed by adding an edge between all pairs of vertices of G with distance at most k. The second power of a graph is also called its square. • Dual graph (only applies to a graph embedded in a surface) • Medial graph • Y-Δ transform • Mycielskian

2.2 Binary operations

Binary operations create a new graph from two initial graphs G1(V1, E1) and G2(V2, E2):

• The union of two graphs G = (VG ,EG) and H = (VH ,EH) is the union of their vertex and edge sets: G ∪ H = (VG ∪ VH,EG ∪ EH). When VG and VH are disjoint, their union is referred to as the disjoint union, and denoted G + H.[1]

5 6 CHAPTER 2. GRAPH OPERATIONS

• Similarly to above, the intersection of two graphs G = (VG ,EG) and H = (VH ,EH) is G ∩ H = (VG ∩ VH, EG ∩ EH).[1] • The graph join (or complete join) of two graphs is their graph union with all the edges that connect the vertices of the first graph with the vertices of the second graph.[2] It is a commutative operation (for unlabelled graphs)

• Graph products based on the Cartesian product of the vertex sets: • Cartesian product of graphs[2] It is a commutative and associative operation (for unlabelled graphs). • Lexicographic product of graphs (also called graph composition) [2] It is associative (for unlabelled graphs), but not commutative. • Strong product of graphs; It is commutative and associative (for unlabelled graphs). • Tensor product of graphs, also called direct product, categorical product, cardinal product, or Kro- necker product. It is a commutative and associative operation (for unlabelled graphs). • Zig-zag product of graphs [3] Let [N] denote the set of integers from 1 to N. It is supposed that k-regular graphs used in the definition below are k-edge colored, i.e., their edge sets are partitioned into k perfect matchings. For each color i and a vertex v let v[i] denote the neighbor of v along the edge colored with color i. Let G1 be a D1-regular graph on [N1] and let G2 be a D2-regular graph on [D1]. Then the zig-zag product H is a graph with vertex set [N1] × [D1], where for all n in [N1], d in [D1], and i,j, in [D2], the vertex (n, d) is connected to (n[d[i]], d[i][j]). This definition is used in construction of expander graphs. • Other graph operations called “products”

• Rooted product of graphs. It is noncommutative, but associative (for unlabelled but rooted graphs) • Corona product or simply corona of G1 and G2, defined by Frucht and Harary[4] is the graph which is the disjoint union of one copy of G1 and |V1| copies of G2 (|V1| is the number of vertices of G1) in which each vertex of the copy of G1 is connected to all vertices of a separate copy of G2. Even for unlabelled graphs, it is neither commutative nor associative.

• Series-parallel graph creation: • Parallel composition. It is a commutative operation (for unlabelled graphs) • Series composition. Non-commutative • Source composition (source merge). It is a commutative operation (for unlabelled graphs)

• The Hajós construction

2.3 Notes

[1] Bondy, J. A.; Murty, U. S. R. (2008). Graph Theory. Graduate Texts in Mathematics. Springer. p. 29. ISBN 978-1- 84628-969-9.

[2] Harary, F. Graph Theory. Reading, MA: Addison-Wesley, 1994.

[3] Reingold, O.; Vadhan, S.; Wigderson, A. (2002). “Entropy waves, the zig-zag graph product, and new constant-degree expanders”. Annals of Mathematics 155 (1): 157–187. doi:10.2307/3062153. JSTOR 3062153. MR 1888797.

[4] Robert Frucht and . “On the coronas of two graphs”, Aequationes Math., 4:322–324, 1970. Chapter 3

Regular graph

In graph theory, a regular graph is a graph where each vertex has the same number of neighbors; i.e. every vertex has the same degree or valency. A regular directed graph must also satisfy the stronger condition that the indegree and outdegree of each vertex are equal to each other.[1] A regular graph with vertices of degree k is called a k‑regular graph or regular graph of degree k. Regular graphs of degree at most 2 are easy to classify: A 0-regular graph consists of disconnected vertices, a 1-regular graph consists of disconnected edges, and a 2-regular graph consists of disconnected cycles and infinite chains. A 3-regular graph is known as a . A strongly regular graph is a regular graph where every adjacent pair of vertices has the same number l of neighbors in common, and every non-adjacent pair of vertices has the same number n of neighbors in common. The smallest graphs that are regular but not strongly regular are the and the circulant graph on 6 vertices.

The complete graph Km is strongly regular for any m . A theorem by Nash-Williams says that every k‑regular graph on 2k + 1 vertices has a Hamiltonian cycle.

• 0-regular graph

• 1-regular graph

• 2-regular graph

• 3-regular graph

3.1 Existence

It is well known that the necessary and sufficient conditions for a k regular graph of order n to exist are that n ≥ k +1 and that nk is even. In such case it is easy to construct regular graphs by considering appropriate parameters for circulant graphs.

3.2 Algebraic properties

Let A be the adjacency matrix of a graph. Then the graph is regular if and only if j = (1,..., 1) is an eigenvector [2] of A. Its eigenvalue will be the constant degree of the graph. Eigenvectors∑ corresponding to other eigenvalues are n orthogonal to j , so for such eigenvectors v = (v1, . . . , vn) , we have i=1 vi = 0 . A regular graph of degree k is connected if and only if the eigenvalue k has multiplicity one.[2] There is also a criterion for regular and connected graphs : a graph is connected and regular if and only if the matrix of ones J, with Jij = 1 , is in the adjacency algebra of the graph (meaning it is a linear combination of powers of A).[3]

7 8 CHAPTER 3. REGULAR GRAPH

Let G be a k-regular graph with diameter D and eigenvalues of adjacency matrix k = λ0 > λ1 ≥ · · · ≥ λn−1 . If G is not bipartite ≤ log (n−1) [4] D log(k/λ) + 1 [4] where λ = maxi>0{| λi |} .

3.3 Generation

Regular graphs may be generated by the GenReg program.[5]

3.4 See also

• Random regular graph • Strongly regular graph

• Moore graph • Cage graph

• Highly irregular graph

3.5 References

[1] Chen, Wai-Kai (1997). Graph Theory and its Engineering Applications. World Scientific. p. 29. ISBN 978-981-02-1859- 1.

[2] Cvetković, D. M.; Doob, M.; and Sachs, H. Spectra of Graphs: Theory and Applications, 3rd rev. enl. ed. New York: Wiley, 1998.

[3] Curtin, Brian (2005), “Algebraic characterizations of graph regularity conditions”, Designs, Codes and Cryptography 34 (2-3): 241–248, doi:10.1007/s10623-004-4857-4, MR 2128333.

[4] http://personal.plattsburgh.edu/quenelgt/pubpdf/diamest.pdf

[5] Meringer, Markus (1999). “Fast generation of regular graphs and construction of cages” (PDF). Journal of Graph Theory 30 (2): 137–146. doi:10.1002/(SICI)1097-0118(199902)30:2<>1.0.CO;2-G.

3.6 External links

• Weisstein, Eric W., “Regular Graph”, MathWorld. • Weisstein, Eric W., “Strongly Regular Graph”, MathWorld.

• GenReg software and data by Markus Meringer. • Nash-Williams, Crispin (1969). “University of Waterloo Research Report”. Waterloo, Ontario: University of Waterloo. |chapter= ignored (help) 3.7. TEXT AND IMAGE SOURCES, CONTRIBUTORS, AND LICENSES 9

3.7 Text and image sources, contributors, and licenses

3.7.1 Text

• Degree (graph theory) Source: https://en.wikipedia.org/wiki/Degree_(graph_theory)?oldid=620178773 Contributors: Michael Hardy, Booyabazooka, Ixfd64, Zero0000, McKay, Altenmann, Gandalf61, MathMartin, Giftlite, Icairns, Mormegil, Sam Derbyshire, Bender235, Obradovic Goran, Cburnett, Oleg Alexandrov, Joriki, Stolee, Maxal, YurikBot, Michael Slone, Kimchi.sg, Nethgirb, Bota47, Masatran, SmackBot, Melchoir, Ixtli, BiT, Tawkerbot2, George100, Shikaga, Quintopia, Hermel, Hut 8.5, David Eppstein, Eloz002, Yecril, Jamelan, Radagast3, Da Joe, Kamyar1, ClueBot, Thingg, SoxBot III, DumZiBoT, Tangi-tamma, Addbot, Tide rolls, Luckas-bot, ThaddeusB, Materialscientist, Twri, ArthurBot, MathsPoetry, Podgy piglet, Status quo not acceptable, RedBot, MastiBot, EmausBot, Pan BMP, Bazuz, Red Stone Arsenal, Wiki13, Deltahedron, Asturius, Athanclark, El Charpi~enwiki, SofjaKovalevskaja and Anonymous: 39 • Graph operations Source: https://en.wikipedia.org/wiki/Graph_operations?oldid=670847853 Contributors: Altenmann, Giftlite, An- dreas Kaufmann, Ben Standeven, Msh210, Arthena, Wicko3, Rjwilmsi, David Eppstein, Maproom, Robert Illes, Dead10ck, Bender2k14, Leen Droogendijk, Addbot, DOI bot, RibotBOT, Akashssp, Citation bot 1, DrilBot, Trappist the monk, Gehilfen, Jonkagstrom, Jeff Erickson and Anonymous: 5 • Regular graph Source: https://en.wikipedia.org/wiki/Regular_graph?oldid=611482994 Contributors: Andre Engels, XJaM, Tomo, Patrick, Michael Hardy, Mxn, McKay, Jaredwf, Altenmann, Gandalf61, MathMartin, Giftlite, Dbenbenn, Gene Ward Smith, Andreas Kaufmann, Arthena, Burn, Oleg Alexandrov, Oliphaunt, Maxal, YurikBot, Dtrebbien, Bota47, Evilbu, Incnis Mrsi, AASoft, JoeKearney, Spiritia, Nikolas Karalis, Stdazi, David Eppstein, Yecril, TXiKiBoT, Rei-bot, Jamelan, Radagast3, Tim32, Hidro, DumZiBoT, Tangi-tamma, Ad- dbot, Luckas-bot, Yobot, Twri, Xqbot, GrouchoBot, Omnipaedista, FrescoBot, G.perarnau, Citation bot 1, RedBot, TobeBot, TheStray- Cat, EmausBot, Sinuhe20, El Roih, Helpful Pixie Bot, Zouba, HandThumb and Anonymous: 20

3.7.2 Images

• File:Commons-logo.svg Source: https://upload.wikimedia.org/wikipedia/en/4/4a/Commons-logo.svg License: ? Contributors: ? Origi- nal artist: ? • File:Conjugate-dessins.svg Source: https://upload.wikimedia.org/wikipedia/commons/5/5d/Conjugate-dessins.svg License: Public do- main Contributors: Self-made; redrawn from figures 2.9 and 2.10 of Lando, Sergei K. & Zvonkin, Alexander K. (2004), Graphs on Surfaces and Their Applications, vol. 141, Encyclopaedia of Mathematical Sciences: Lower-Dimensional Topology II, Springer-Verlag. Original artist: David Eppstein • File:Depth-first-tree.png Source: https://upload.wikimedia.org/wikipedia/commons/5/5d/Depth-first-tree.png License: CC-BY-SA- 3.0 Contributors: • Wolfram Esser Original artist: Wolfram Esser • File:UndirectedDegrees_(Loop).svg Source: https://upload.wikimedia.org/wikipedia/commons/d/d6/UndirectedDegrees_%28Loop% 29.svg License: GFDL Contributors: Original artist: Melchoir (source); pan BMP

3.7.3 Content license

• Creative Commons Attribution-Share Alike 3.0