Vol 232, No 1 (2018)
- Year: 2018
- Articles: 8
- URL: https://journals.rcsi.science/1072-3374/issue/view/14928
Article
On the Connection Between the Chromatic Number of a Graph and the Number of Cycles Covering a Vertex or an Edge
Abstract
We prove several tight bounds on the chromatic number of a graph in terms of the minimum number of simple cycles covering a vertex or an edge of this graph. Namely, we prove that X(G) ≤ k in the following two cases: any edge of G is covered by less than [e(k − 1) ! − 1] simple cycles, or any vertex of G is covered by less than \( \left[\frac{ek!}{2}-\frac{k+1}{2}\right] \) simple cycles. Tight bounds on the number of simple cycles covering an edge or a vertex of a k-critical graph are also proved.
On the Characteristic Polynomial and Eigenvectors in Terms of the Tree-Like Structure of a Digraph
Abstract
Regarding a square matrix as the adjacency matrix of a weighted digraph, we construct an extended digraph whose Laplacian contains the original matrix as a submatrix. This construction allows us to use known results on Laplacians to study arbitrary square matrices. The calculation of an eigenvector in a parametric form demonstrates a connection between its components and the tree-like structure of the digraph.
Bounds on the Dynamic Chromatic Number of a Graph in Terms of its Chromatic Number
Abstract
A vertex coloring of a graph is called dynamic if the neighborhood of any vertex of degree at least 2 contains at least two vertices of distinct colors. Similarly to the chromatic number χ(G) of a graph G, one can define its dynamic number χd(G) (the minimum number of colors in a dynamic coloring) and dynamic chromatic number χ2(G) (the minimum number of colors in a proper dynamic coloring). We prove that χ2(G) ≤ χ(G) · χd(G) and construct an infinite series of graphs for which this bound on χ2(G) is tight.
For a graph G, set \( k=\left\lceil \frac{2\Delta (G)}{\delta (G)}\right\rceil \) We prove that χ2(G) ≤ (k+1)c. Moreover, in the case where k ≥ 3 and Δ(G) ≥ 3, we prove the stronger bound χ2(G) ≤ kc.
An Algorithm for Solving an Overdetermined Tropical Linear System Using the Analysis of Stable Solutions of Subsystems
Abstract
In this paper, we show that an overdetermined tropical linear system has a solution if and only if it contains a square subsystem having a stable solution that is a solution of the original system. This leads to a simple algorithm for solving tropical linear systems in time \( O\left(\left({}_n^m\right)\right){n}^4 \), where m is the number of equations and n is the number of variables. For weakly overdetermined systems, this time is polynomial.
Lower Bounds on the Number of Leaves in Spanning Trees
Abstract
Let G be a connected graph on n ≥ 2 vertices with girth at least g such that the length of a maximal chain of successively adjacent vertices of degree 2 in G does not exceed k ≥ 1. Denote by u(G) the maximum number of leaves in a spanning tree of G. We prove that u(G) ≥ αg,k(υ(G) − k − 2) + 2 where \( {\alpha}_{g,1}=\frac{\left[\frac{g+1}{2}\right]}{4\left[\frac{g+1}{2}\right]+1} \) and \( {\alpha}_{g,k}=\frac{1}{2k+2} \) for k ≥ 2. We present an infinite series of examples showing that all these bounds are tight.
On the Decomposition of a 3-Connected Graph into Cyclically 4-Edge-Connected Components
Abstract
A graph is called cyclically 4-edge-connected if removing any three edges from it results in a graph in which at most one connected component contains a cycle. A 3-connected graph is 4-edge-connected if and only if removing any three edges from it results in either a connected graph or a graph with exactly two connected components one of which is a single-vertex one. We show how to associate with any 3-connected graph a tree of components such that every component is a 3-connected and cyclically 4-edge-connected graph.
An Upper Bound on the Number of Edges of a Graph Whose kth Power Has a Connected Complement
Abstract
We say that a graph is k-wide if for any partition of its vertex set into two subsets, one can choose vertices at distance at least k in these subsets (i.e., the complement of the kth power of this graph is connected). We say that a graph is k-mono-wide if for any partition of its vertex set into two subsets, one can choose vertices at distance exactly k in these subsets.
We prove that the complement of a 3-wide graph on n vertices has at least 3n − 7 edges, and the complement of a 3-mono-wide graph on n vertices has at least 3n − 8 edges. We construct infinite series of graphs for which these bounds are attained.
We also prove an asymptotically tight bound for the case k ≥ 4: the complement of a k-wide graph contains at least (n − 2k)(2k − 4[log2k] − 1) edges.