On the fractional chromatic index of a graph and its complement
نویسندگان
چکیده
منابع مشابه
On the fractional chromatic index of a graph and its complement
The chromatic index χ e(G) of an undirected graph G is the minimum number of matchings needed to partition its edge set. Let ∆(G) denote the maximum vertex degree of G, and let G denote the complement of G. Jensen and Toft conjectured that for a graph G with an even number of vertices, either χ e(G) = ∆(G) or χ e(G) = ∆(G). We prove a fractional version of this conjecture. 1. The Introduction T...
متن کاملDegree distance index of the Mycielskian and its complement
In this paper, we determine the degree distance of the complement of arbitrary Mycielskian graphs. It is well known that almost all graphs have diameter two. We determine this graphical invariant for the Mycielskian of graphs with diameter two.
متن کاملThe b-chromatic index of a graph
The b-chromatic index φ(G) of a graph G is the largest integer k such that G admits a proper k-edge coloring in which every color class contains at least one edge incident to some edge in all the other color classes. The b-chromatic index of trees is determined and equals either to a natural upper bound m(T ) or one less, where m(T ) is connected with the number of edges of high degree. Some co...
متن کاملthe geopolitics of afghanistan after september 11, 2001, and its impact on iranian national security
abstract u.s. attack to afghanistan after 9/11 provided opportunities for us who tried to become the dominant power after collapse of ussr and bipolar world. thinkers like fukuyama believed american liberal democrats thought would be universally accepted without resistances. liberal democracy is the best and final model of governance; in this regard, united state has moral responsibilities for...
15 صفحه اولOn the Connectivity of a Graph and its Complement Graph
In this paper, we study the connectivity of the complement of a graph. We first establish a simple formula to compute the connectivity of a graph that comes from the join of graphs. Base on this formula, we give an upper and a lower bound to the connectivity of the complement of a graph. Keyword: connectivity, complement, join, vertex of attachment.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Letters
سال: 2005
ISSN: 0167-6377
DOI: 10.1016/j.orl.2004.08.009