Mixed graph

Last updated April 24, 2024

In graph theory, a mixed graph $G = (V, E, A)$ is a graph consisting of a set of vertices $V$ , a set of (undirected) edges $E$ , and a set of directed edges (or arcs) $A$ .^[1]

Definitions and notation

Consider adjacent vertices $u,v\in V$ . A directed edge, called an arc, is an edge with an orientation and can be denoted as ${\overrightarrow {uv}}$ or $(u,v)$ (note that $u$ is the tail and $v$ is the head of the arc).^[2] Also, an undirected edge, or edge, is an edge with no orientation and can be denoted as $uv$ or $[u,v]$ .^[2]

For the purpose of our example we will not be considering loops or multiple edges of mixed graphs.

A walk in a mixed graph is a sequence $v_{0},c_{1},v_{1},c_{2},v_{2},\dots ,c_{k},v_{k}$ of vertices and edges/arcs such that for every index $i$ , either $c_{i}=v_{i}v_{i+1}$ is an edge of the graph or $c_{i}={\overrightarrow {v_{i}v_{i+1}}}$ is an arc of the graph. This walk is a path if it does not repeat any edges, arcs, or vertices, except possibly the first and last vertices. A walk is closed if its first and last vertices are the same, and a closed path is a cycle . A mixed graph is acyclic if it does not contain a cycle.

Coloring

Mixed graph coloring can be thought of as a labeling or an assignment of $k$ different colors (where $k$ is a positive integer) to the vertices of a mixed graph.^[3] Different colors must be assigned to vertices that are connected by an edge. The colors may be represented by the numbers from $1$ to $k$ , and for a directed arc, the tail of the arc must be colored by a smaller number than the head of the arc.^[3]

Example

For example, consider the figure to the right. Our available $k$ -colors to color our mixed graph are ${1, 2, 3}.$ Since $u$ and $v$ are connected by an edge, they must receive different colors or labelings ( $u$ and $v$ are labelled 1 and 2, respectively). We also have an arc from $v$ to $w$ . Since orientation assigns an ordering, we must label the tail ( $v$ ) with a smaller color (or integer from our set) than the head ( $w$ ) of our arc.

Strong and weak coloring

A (strong) proper $k$ -coloring of a mixed graph is a function $c : V \to [k]$ where $[k] := {1, 2, \dots, k}$ such that $c (u) \neq c (v)$ if $uv \in E$ and $c (u) < c (v)$ if ${\overrightarrow {uv}}\in A$ .^[1]

A weaker condition on our arcs can be applied and we can consider a weak proper $k$ -coloring of a mixed graph to be a function $c : V \to [k]$ where $[k] := {1, 2, \dots, k}$ such that $c (u) \neq c (v)$ if $uv \in E$ and $c (u) \leq c (v)$ if ${\overrightarrow {uv}}\in A$ .^[1] Referring back to our example, this means that we can label both the head and tail of $(v, w)$ with the positive integer 2.

Counting

A coloring may or may not exist for a mixed graph. In order for a mixed graph to have a $k$ -coloring, the graph cannot contain any directed cycles.^[2] If such a $k$ -coloring exists, then we refer to the smallest $k$ needed in order to properly color our graph as the chromatic number, denoted by $χ (G)$ .^[2] The number of proper $k$ -colorings is a polynomial function of $k$ called the chromatic polynomial of our graph $G$ (by analogy with the chromatic polynomial of undirected graphs) and can be denoted by $χ G (k)$ .^[1]

Computing weak chromatic polynomials

The deletion–contraction method can be used to compute weak chromatic polynomials of mixed graphs. This method involves deleting (i.e., removing) an edge or arc and possibly joining the remaining vertices incident to that edge or arc to form one vertex.^[4] After deleting an edge $e$ from a mixed graph $G = (V, E, A)$ we obtain the mixed graph $(V, E - e, A)$ . We denote this deletion of the edge $e$ by $G - e$ . Similarly, by deleting an arc $a$ from a mixed graph, we obtain $(V, E, A - a)$ where we denote the deletion of $a$ by $G - a$ . Also, we denote the contraction of $e$ and $a$ by $G / e$ and $G / a$ , respectively. From Propositions given in Beck et al.^[4] we obtain the following equations to compute the chromatic polynomial of a mixed graph:^[5]

$\chi _{G}(k)=\chi _{G-e}(k)-\chi _{G/e}(k)$ ,
$\chi _{G}(k)=\chi _{G-a}(k)+\chi _{G/a}(k)-\chi _{G_{a}}(k)$ .

Applications

Scheduling problem

Mixed graphs may be used to model job shop scheduling problems in which a collection of tasks is to be performed, subject to certain timing constraints. In this sort of problem, undirected edges may be used to model a constraint that two tasks are incompatible (they cannot be performed simultaneously). Directed edges may be used to model precedence constraints, in which one task must be performed before another. A graph defined in this way from a scheduling problem is called a disjunctive graph. The mixed graph coloring problem can be used to find a schedule of minimum length for performing all the tasks.^[2]

Bayesian inference

Mixed graphs are also used as graphical models for Bayesian inference. In this context, an acyclic mixed graph (one with no cycles of directed edges) is also called a chain graph. The directed edges of these graphs are used to indicate a causal connection between two events, in which the outcome of the first event influences the probability of the second event. Undirected edges, instead, indicate a non-causal correlation between two events. A connected component of the undirected subgraph of a chain graph is called a chain. A chain graph may be transformed into an undirected graph by constructing its moral graph, an undirected graph formed from the chain graph by adding undirected edges between pairs of vertices that have outgoing edges to the same chain, and then forgetting the orientations of the directed edges.^[6]

Notes

1 2 3 4 Beck et al. (2013 , p. 1)
1 2 3 4 5 Ries (2007 , p. 1)
1 2 Hansen, Kuplinsky & de Werra (1997 , p. 1)
1 2 Beck et al. (2013 , p. 4)
↑ Beck et al. (2013 , p. 5)
↑ Cowell et al. (1999).

Related Research Articles

This is a glossary of graph theory. Graph theory is the study of graphs, systems of nodes or vertices connected in pairs by lines or edges.

In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called "colors" to elements of a graph subject to certain constraints. In its simplest form, it is a way of coloring the vertices of a graph such that no two adjacent vertices are of the same color; this is called a vertex coloring. Similarly, an edge coloring assigns a color to each edge so that no two adjacent edges are of the same color, and a face coloring of a planar graph assigns a color to each face or region so that no two faces that share a boundary have the same color.

In the mathematical field of graph theory, a graph homomorphism is a mapping between two graphs that respects their structure. More concretely, it is a function between the vertex sets of two graphs that maps adjacent vertices to adjacent vertices.

In graph theory, a proper edge coloring of a graph is an assignment of "colors" to the edges of the graph so that no two incident edges have the same color. For example, the figure to the right shows an edge coloring of a graph by the colors red, blue, and green. Edge colorings are one of several different types of graph coloring. The edge-coloring problem asks whether it is possible to color the edges of a given graph using at most $k$ different colors, for a given value of $k$ , or with the fewest possible colors. The minimum required number of colors for the edges of a given graph is called the chromatic index of the graph. For example, the edges of the graph in the illustration can be colored by three colors but cannot be colored by two colors, so the graph shown has chromatic index three.

Fractional coloring is a topic in a young branch of graph theory known as fractional graph theory. It is a generalization of ordinary graph coloring. In a traditional graph coloring, each vertex in a graph is assigned some color, and adjacent vertices — those connected by edges — must be assigned different colors. In a fractional coloring however, a set of colors is assigned to each vertex of a graph. The requirement about adjacent vertices still holds, so if two vertices are joined by an edge, they must have no colors in common.

The chromatic polynomial is a graph polynomial studied in algebraic graph theory, a branch of mathematics. It counts the number of graph colorings as a function of the number of colors and was originally defined by George David Birkhoff to study the four color problem. It was generalised to the Tutte polynomial by Hassler Whitney and W. T. Tutte, linking it to the Potts model of statistical physics.

In graph theory, the Hadwiger conjecture states that if $is loopless and has no minor then its chromatic number satisfies . It is known to be true for . The conjecture is a generalization of the four-color theorem and is considered to be one of the most important and challenging open problems in the field.$

The Tutte polynomial, also called the dichromate or the Tutte–Whitney polynomial, is a graph polynomial. It is a polynomial in two variables which plays an important role in graph theory. It is defined for every undirected graph $and contains information about how the graph is connected. It is denoted by .$

In the mathematical area of graph theory, the Mycielskian or Mycielski graph of an undirected graph is a larger graph formed from it by a construction of Jan Mycielski. The construction preserves the property of being triangle-free but increases the chromatic number; by applying the construction repeatedly to a triangle-free starting graph, Mycielski showed that there exist triangle-free graphs with arbitrarily large chromatic number.

In graph theory, Hedetniemi's conjecture, formulated by Stephen T. Hedetniemi in 1966, concerns the connection between graph coloring and the tensor product of graphs. This conjecture states that

In graph theory, a nowhere-zero flow or NZ flow is a network flow that is nowhere zero. It is intimately connected to coloring planar graphs.

In graph theory, oriented graph coloring is a special type of graph coloring. Namely, it is an assignment of colors to vertices of an oriented graph that

In graph theory, circular coloring is a kind of coloring that may be viewed as a refinement of the usual graph coloring. The circular chromatic number of a graph $, denoted can be given by any of the following definitions, all of which are equivalent.$

$is the infimum over all real numbers so that there exists a map from to a circle of circumference 1 with the property that any two adjacent vertices map to points at distance along this circle.$
$is the infimum over all rational numbers so that there exists a map from to the cyclic group with the property that adjacent vertices map to elements at distance apart.$
In an oriented graph, declare the imbalance of a cycle $to be divided by the minimum of the number of edges directed clockwise and the number of edges directed counterclockwise. Define the imbalance of the oriented graph to be the maximum imbalance of a cycle. Now, is the minimum imbalance of an orientation of .$

In the mathematical field of graph theory, the Chvátal graph is an undirected graph with 12 vertices and 24 edges, discovered by Václav Chvátal in 1970. It is the smallest graph that is triangle-free, 4-regular, and 4-chromatic.

In graph theory, an acyclic orientation of an undirected graph is an assignment of a direction to each edge that does not form any directed cycle and therefore makes it into a directed acyclic graph. Every graph has an acyclic orientation.

<span class="mw-page-title-main">T-coloring</span>

In graph theory, a T-Coloring of a graph $, given the set T of nonnegative integers containing 0, is a function that maps each vertex to a positive integer (color) such that if u and w are adjacent then . In simple words, the absolute value of the difference between two colors of adjacent vertices must not belong to fixed set T . The concept was introduced by William K. Hale. If T = {0} it reduces to common vertex coloring.$

In graph theory, a branch of mathematics, the Erdős–Hajnal conjecture states that families of graphs defined by forbidden induced subgraphs have either large cliques or large independent sets. It is named for Paul Erdős and András Hajnal, who first posed it as an open problem in a paper from 1977.

The graph coloring game is a mathematical game related to graph theory. Coloring game problems arose as game-theoretic versions of well-known graph coloring problems. In a coloring game, two players use a given set of colors to construct a coloring of a graph, following specific rules depending on the game we consider. One player tries to successfully complete the coloring of the graph, when the other one tries to prevent him from achieving it.

In graph theory, the act of coloring generally implies the assignment of labels to vertices, edges or faces in a graph. The incidence coloring is a special graph labeling where each incidence of an edge with a vertex is assigned a color under certain constraints.

In graph theory, a deletion-contraction formula / recursion is any formula of the following recursive form:

References

Beck, M.; Blado, D.; Crawford, J.; Jean-Louis, T.; Young, M. (2013), "On weak chromatic polynomials of mixed graphs", Graphs and Combinatorics , arXiv: 1210.4634 , doi:10.1007/s00373-013-1381-1 .
Cowell, Robert G.; Dawid, A. Philip; Lauritzen, Steffen L.; Spiegelhalter, David J. (1999), Probabilistic Networks and Expert Systems: Exact Computational Methods for Bayesian Networks, Springer-Verlag New York, p. 27, doi:10.1007/0-387-22630-3, ISBN 0-387-98767-3
Hansen, Pierre; Kuplinsky, Julio; de Werra, Dominique (1997), "Mixed graph colorings", Mathematical Methods of Operations Research, 45 (1): 145–160, doi:10.1007/BF01194253, MR 1435900 .
Ries, B. (2007), "Coloring some classes of mixed graphs", Discrete Applied Mathematics , 155 (1): 1–6, doi: 10.1016/j.dam.2006.05.004 , MR 2281351 .

External links

Weisstein, Eric W. "Mixed Graph". MathWorld .

This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.

[BeckBladoCrawfordJeanLouisYoung-1] 1 2 3 4 Beck et al. (2013 , p. 1)

[Ries-2] 1 2 3 4 5 Ries (2007 , p. 1)

[HansenKuplinskydeWerra-3] 1 2 Hansen, Kuplinsky & de Werra (1997 , p. 1)

[BeckBladoCrawfordJeanLouisYoung_a-4] 1 2 Beck et al. (2013 , p. 4)

[BeckBladoCrawfordJeanLouisYoung_b-5] Beck et al. (2013 , p. 5)

[FOOTNOTECowellDawidLauritzenSpiegelhalter1999-6] Cowell et al. (1999).

[1]

[2]

[3]

[4]

[5]

[6]