Connected pseudoachromatic index of complete graphs
نویسندگان
چکیده
A connected pseudocomplete n-coloring of a graph G is a (non-proper) n-coloring of the vertices of G such that each color class induces a connected subgraph and for each pair of color classes there is an edge with one end of each color; this can be viewed as a kind of “inverse image” of a clique minor. The connected pseudoachromatic index of a graph G is the largest n for which the line graph of G has a connected pseudocomplete ncoloring. For all j, k we show that the connected pseudoachromatic index of the complete graph on 5k+j+1 vertices is at least 9k+j. We also provide several results on connections between connected pseudoachromatic index of complete graphs and the Erdős-Faber-Lovasz conjecture.
منابع مشابه
Geometric Achromatic and Pseudoachromatic Indices
The pseudoachromatic index of a graph is the maximum number of colors that can be assigned to its edges, such that each pair of different colors is incident to a common vertex. If for each vertex its incident edges have different color, then this maximum is known as achromatic index. Both indices have been widely studied. A geometric graph is a graph drawn in the plane such that its vertices ar...
متن کاملOn the Pseudoachromatic Index of the Complete Graph III
Let q = 2 be, for some β ∈ IN, and let n = q + q + 1. By exhibiting a complete colouring of the edges of Kn, we show that the pseudoachromatic number of the complete line graph Gn = L(Kn) is at least ψ(Gn) ≥ q+q —this bound improves the implicit bound of Jamison [9] which is given in terms of the achromatic number: ψ(Gn) ≥ α(Gn) ≥ q +1. We also calculate, precisely, the pseudoachromatic number ...
متن کاملSharp Upper bounds for Multiplicative Version of Degree Distance and Multiplicative Version of Gutman Index of Some Products of Graphs
In $1994,$ degree distance of a graph was introduced by Dobrynin, Kochetova and Gutman. And Gutman proposed the Gutman index of a graph in $1994.$ In this paper, we introduce the concepts of multiplicative version of degree distance and the multiplicative version of Gutman index of a graph. We find the sharp upper bound for the multiplicative version of degree distance and multiplicative ver...
متن کاملThe Pseudoachromatic Number of a Graph
The pseudoachromatic number of a graph G is the maximum size of a vertex partition of G (where the sets of the partition may or may not be independent) such that, between any two distinct parts, there is at least one edge of G. This parameter is determined for graphs such as cycles, paths, wheels, certain complete multipartite graphs, and for other classes of graphs. Some open problems are raised.
متن کاملThe maximal total irregularity of some connected graphs
The total irregularity of a graph G is defined as 〖irr〗_t (G)=1/2 ∑_(u,v∈V(G))▒〖|d_u-d_v |〗, where d_u denotes the degree of a vertex u∈V(G). In this paper by using the Gini index, we obtain the ordering of the total irregularity index for some classes of connected graphs, with the same number of vertices.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 60 شماره
صفحات -
تاریخ انتشار 2014