Extension of Gyárfás-Sumner Conjecture to Digraphs

The dichromatic number of a digraph $D$ is the minimum number of colors needed to color its vertices in such a way that each color class induces an acyclic digraph. As it generalizes the notion of the chromatic number of graphs, it has become the focus of numerous works. In this work we look at possible extensions of the Gyárfás-Sumner conjecture. In particular, we conjecture a simple characterization of sets $\mathcal F$ of three digraphs such that every digraph with sufficiently large dichromatic number must contain a member of $\mathcal F$ as an induced subdigraph. Among notable results, we prove that oriented $K_4$-free graphs without a directed path of length $3$ have bounded dichromatic number where a bound of $414$ is provided. We also show that an orientation of a complete multipartite graph with no directed triangle is $2$-colorable. To prove these results we introduce the notion of nice sets that might be of independent interest.

The Size, Multipartite Ramsey Numbers for nK2 Versus Path–Path and Cycle

For given graphs G1,G2,…,Gn and any integer j, the size of the multipartite Ramsey number mj(G1,G2,…,Gn) is the smallest positive integer t such that any n-coloring of the edges of Kj×t contains a monochromatic copy of Gi in color i for some i, 1≤i≤n, where Kj×t denotes the complete multipartite graph having j classes with t vertices per each class. In this paper, we computed the size of the multipartite Ramsey numbers mj(K1,2,P4,nK2) for any j,n≥2 and mj(nK2,C7), for any j≤4 and n≥2.

Shapley Distance and Shapley Index for Some Special Graphs

The Shapley distance in a graph is defined based on Shapley value in cooperative game theory. It is used to measure the cost for a vertex in a graph to access another vertex. In this paper, we establish the Shapley distance between two arbitrary vertices for some special graphs, i.e., path, tree, cycle, complete graph, complete bipartite, and complete multipartite graph. Moreover, based on the Shapley distance, we propose a new index, namely Shapley index, and then compare Shapley index with Wiener index and Kirchhoff index for these special graphs. We also characterize the extremal graphs in which these three indices are equal.

\(C_{6}\)-decompositions of the tensor product of complete graphs

Let \(G\) be a simple and finite graph. A graph is said to be decomposed into subgraphs \(H_1\) and \(H_2\) which is denoted by \(G= H_1 \oplus H_2\), if \(G\) is the edge disjoint union of \(H_1\) and \(H_2\). If \(G= H_1 \oplus H_2 \oplus \cdots \oplus H_k\), where \(H_1\), \(H_2\), ..., \(H_k\) are all isomorphic to \(H\), then \(G\) is said to be \(H\)-decomposable. Furthermore, if \(H\) is a cycle of length \(m\) then we say that \(G\) is \(C_m\)-decomposable and this can be written as \(C_m|G\). Where \( G\times H\) denotes the tensor product of graphs \(G\) and \(H\), in this paper, we prove that the necessary conditions for the existence of \(C_6\)-decomposition of \(K_m \times K_n\) are sufficient. Using these conditions it can be shown that every even regular complete multipartite graph \(G\) is \(C_6\)-decomposable if the number of edges of \(G\) is divisible by \(6\).

Estrada Index and Laplacian Estrada Index of Random Interdependent Graphs

Let G be a simple graph of order n. The Estrada index and Laplacian Estrada index of G are defined by E E ( G ) = ∑ i = 1 n e λ i ( A ( G ) ) and L E E ( G ) = ∑ i = 1 n e λ i ( L ( G ) ) , where { λ i ( A ( G ) ) } i = 1 n and { λ i ( L ( G ) ) } i = 1 n are the eigenvalues of its adjacency and Laplacian matrices, respectively. In this paper, we establish almost sure upper bounds and lower bounds for random interdependent graph model, which is fairly general encompassing Erdös-Rényi random graph, random multipartite graph, and even stochastic block model. Our results unravel the non-triviality of interdependent edges between different constituting subgraphs in spectral property of interdependent graphs.

Some Properties of Coprime Graph of Dihedral Group D_2n When n is a Prime Power

The Study of algebraic structures, especially on graphs theory, leads to anew topics of research in recent years. In this paper, the algebraic structures that will be represented by a coprime graph are the dihedral group and its subgroups. The coprime graph of a group G, denoted by \Gamma_D_2n is a graph whose vertices are elements of G and two distinct vertices a and b are adjacent if only if (|a,|b|)=1. Some properties of the coprime graph of a dihedral group D_2n are obtained. One of the results is if n is prime then \Gamma_D_2n is a complete bipartite graph. Moreover, if n is the power of prime then \Gamma_D_2n is a multipartite graph.

The Energy Change of the Complete Multipartite Graph

The energy of a graph is defined as the sum of the absolute values of all eigenvalues of the graph. Akbari et al. [S. Akbari, E. Ghorbani, and M. Oboudi. Edge addition, singular values, and energy of graphs and matrices. {\em Linear Algebra Appl.}, 430:2192--2199, 2009.] proved that for a complete multipartite graph $K_{t_1 ,\ldots,t_k}$, if $t_i\geq 2 \ (i=1,\ldots,k)$, then deleting any edge will increase the energy. A natural question is how the energy changes when $\min\{t_1 ,\ldots,t_k\}=1$. In this paper, a new method to study the energy of graph is explored. As an application of this new method, the above natural question is answered and it is completely determined how the energy of a complete multipartite graph changes when one edge is removed.

Partition Dimension of Complete Multipartite Graph

Determining a resolving partition of a graph is an interesting study in graph theory due to many applications like censor design, compound classification in chemistry, robotic navigation and internet network. Let and , the distance between an is . For an ordered partition of , the representation of with respect to is . The partition is called a resolving partition of if all representation of vertices are distinct. The partition dimension of graph is the smallest integer such that has a resolving partition with element.In this thesis, we determine the partition dimension of complete multipartite graph , which is limited by , with and . We found that , , and , .