arXiv 1809.071862018-09-21math.CO

General Equitable Decompositions for Graphs with Symmetries

Amanda Francis, Dallas Smith, Benjamin Webb

备注：: arXiv admin note: text overlap with arXiv:1702.00796

英文摘要：

Using the theory of equitable decompositions it is possible to decompose a matrix $M$ appropriately associated with a given graph. The result is a collection of smaller matrices whose collective eigenvalues are the same as the eigenvalues of the original matrix $M$. This is done by decomposing the matrix over a graph symmetry. Previously it was shown that a matrix can be equitably decomposed over any uniform, basic, or separable automorphism. Here we extend this theory to show that it is possible to equitably decompose a matrix over any automorphism of a graph, without restriction. Moreover, we give a step-by-step procedure which can be used to generate such a decomposition. We also prove under mild conditions that if a matrix $M$ is equitably decomposed the resulting divisor matrix, which is the divisor matrix of the associated equitable partition, will have the same spectral radius as the original matrix $M$.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Equitable Decompositions of Graphs

We investigate connections between the symmetries (automorphisms) of a graph and its spectral properties. Whenever a graph has a symmetry, i.e. a nontrivial automorphism $ϕ$, it is possible to use $ϕ$ to decompose any matrix $M\in\mathbb{C}^{n \times n}$ appropriately associated with the graph. The result of this decomposition is a number of strictly smaller matrices whose collective eigenvalues are the same as the eigenvalues of the original matrix $M$. Some of the matrices that can be decomposed are the graph's adjaceny matrix, Laplacian matrix, etc. Because this decomposition has connection…

2016-10-05math.CO

Extensions and Applications of Equitable Decompositions for Graphs with Symmetries

We extend the theory of equitable decompositions, in which, if a graph has a particular type of symmetry, i.e. a uniform or basic automorphism $ϕ$, it is possible to use $ϕ$ to decompose a matrix $M$ appropriately associated with the graph. The result is a number of strictly smaller matrices whose collective eigenvalues are the same as the eigenvalues of the original matrix $M$. We show here that a large class of automorphisms, which we refer to as \emph{separable}, can be realized as a sequence of basic automorphisms, allowing us to equitably decompose $M$ over any such automorphism. We also …

2017-07-29math.CO

Equitable Colorings of $K\_4$-minor-free Graphs

We demonstrate that for every positive integer $Δ$, every K\_4-minor-free graph with maximum degree $Δ$ admits an equitable coloring with k colors wherek $\ge$ ($Δ$+3)/2. This bound is tight and confirms a conjecture by Zhang and Whu. We do not use the discharging method but rather exploit decomposition trees of K 4-minor-free graphs.

2017-03-07math.CO

Generating Graphs with Symmetry

In the field of complex networks and graph theory, new results are typically tested on graphs generated by a variety of algorithms such as the Erdős-Rényi model or the Barabási-Albert model. Unfortunately, most graph generating algorithms do not typically create graphs with symmetries, which have been shown to have an important role on the network dynamics. Here, we present an algorithm to generate graphs with prescribed symmetries. The algorithm can also be used to generate graphs with a prescribed equitable partition but possibly without any symmetry. We also use our graph generator to exami…

2018-08-15math.CO

Cyclic decomposition of k-permutations and eigenvalues of the arrangement graphs

The (n,k)-arrangement graph A(n,k) is a graph with all the k-permutations of an n-element set as vertices where two k-permutations are adjacent if they agree in exactly k-1 positions. We introduce a cyclic decomposition for k-permutations and show that this gives rise to a very fine equitable partition of A(n,k). This equitable partition can be employed to compute the complete set of eigenvalues (of the adjacency matrix) of A(n,k). Consequently, we determine the eigenvalues of A(n,k) for small values of k. Finally, we show that any eigenvalue of the Johnson graph J(n,k) is an eigenvalue of A(n…

2013-11-09math.CO

Equitable $d$-degenerate choosability of graphs

Let ${\mathcal D}_d$ be the class of $d$-degenerate graphs and let $L$ be a list assignment for a graph $G$. A colouring of $G$ such that every vertex receives a colour from its list and the subgraph induced by vertices coloured with one color is a $d$-degenerate graph is called the $(L,{\mathcal D}_d)$-colouring of $G$. For a $k$-uniform list assignment $L$ and $d\in\mathbb{N}_0$, a graph $G$ is equitably $(L,{\mathcal D}_d)$-colorable if there is an $(L,{\mathcal D}_d)$-colouring of $G$ such that the size of any colour class does not exceed $\left\lceil|V(G)|/k\right\rceil$. An equitable $(L…

2020-03-21math.CO

更多相关论文收起更多论文

Equitable vertex arboricity conjecture holds for graphs with low degeneracy

The equitable tree-coloring can formulate a structure decomposition problem on the communication network with some security considerations. Namely, an equitable tree-$k$-coloring of a graph is a vertex coloring using $k$ distinct colors such that every color class induces a forest and the sizes of any two color classes differ by at most one. In this paper, we show some theoretical results on the equitable tree-coloring of graphs by proving that every $d$-degenerate graph with maximum degree at most $Δ$ is equitably tree-$k$-colorable for every integer $k\geq (Δ+1)/2$ provided that $Δ\geq 9.818…

2021-04-12cs.DMmath.CO

Edge arboricity : Do we need equitabilility ?

In this paper we study a new variant of graph arboricity, which requires all the forests to have the same number of edges (up to a difference of 1). We prove that the new variant, which we call equitable arboricity, is equivalent to ordinary arboricity. In other words we show that any arborescent decomposition of a graph can be transformed into an equitable one without modifying the number of used forests.

2017-05-03math.CO

Equitable tree-$O(d)$-coloring of $d$-degenerate graphs

An equitable tree-$k$-coloring of a graph is a vertex coloring on $k$ colors so that every color class incudes a forest and the sizes of any two color classes differ by at most one.This kind of coloring was first introduced in 2013 and can be used to formulate the structure decomposition problem on the communication network with some security considerations. In 2015, Esperet, Lemoine and Maffray showed that every $d$-degenerate graph admits an equitable tree-$k$-coloring for every $k\geq 3^{d-1}$. Motivated by this result, we attempt to lower their exponential bound to a linear bound. Precisel…

2019-08-14cs.DMmath.CO

从半总到公平总着色

From semi-total to equitable total colorings, and their induced partitions into perfect and total perfect codes

University of Puerto Rico（波多黎各大学）

研究通过改进的Kempe算法获取对称立方图和笼图的公平总着色，探讨总着色猜想的可行性。

2026-09-07math.CO

14是使得所有立方图的每个4-全着色均为均匀着色的最大阶数

Order 14 is the largest order for which every 4-total coloring of every cubic graph is equitable

Universidade Federal do Rio de Janeiro（里约热内卢联邦大学）；Universidade do Estado do Rio de Janeiro（里约热内卢州立大学）

本文否定Stemock关于阶数小于20的立方图的4-全着色均为均匀着色的猜想，证明14是满足该性质的最大阶数，给出相关分解引理并构造反例。

2026-09-07cs.DMmath.CO

关于混合图中匹配森林和数字有向图中 $b$-分支的公平划分的注记

Notes on Equitable Partitions into Matching Forests in Mixed Graphs and into $b$-branchings in Digraphs

本文提出有向图中分支公平划分的两个扩展：混合图中匹配森林的单准则公平划分和数字有向图中 $b$-分支的公平划分，并证明存在性及多面体的整数分解性质。

2022-03-30cs.DMcs.DSmath.CO

Characteristic polynomials and zeta functions of equitably partitioned graphs

Let $π=\{V_1,\dots,V_r\}$ be an equitable partition of the vertex set of a directed graph (digraph) $X$. It is well known that the characteristic polynomial $ϕ(X/π,x)$ of a quotient graph $X/π$ divides that of $X$, but the remainder part is not well investigated. In this paper, we define a deletion graph $X\backslashπ$ over an equitable partition $π$, which is a signed directed graph defined for a fixed set of deleting vertices $\{\bar{v}_i\in V_i, i=1,\cdots,r\}$, and give a similarity transformation exchanging the adjacency matrix $A(X)$ which is compatible with the equitable partition for a…

2019-12-21math.CO