Upper bounds on the uniquely restricted chromatic index
نویسندگان
چکیده
منابع مشابه
Two Upper Bounds on the Chromatic Number
Processor cache memory management is a challenging issue as it deeply impact performances and power consumption of electronic devices. It has been shown that allocating data structures to memory for a given application (as MPEG encoding, filtering or any other signal processing application) can be modeled as a minimum k-weighted graph coloring problem, on the so-called conflict graph. The graph...
متن کاملUpper bounds on the b-chromatic number and results for restricted graph classes
A b-coloring of a graph G by k colors is a proper vertex coloring such that every color class contains a color-dominating vertex, that is, a vertex having neighbors in all other k−1 color classes. The b-chromatic number χb(G) is the maximum integer k for which G has a b-coloring by k colors. Moreover, the graph G is called b-continuous if G admits a b-coloring by k colors for all k satisfying χ...
متن کاملUpper Bounds of Dynamic Chromatic Number
A proper vertex k-coloring of a graph G is dynamic if for every vertex v with degree at least 2, the neighbors of v receive at least two different colors. The smallest integer k such that G has a dynamic k-coloring is the dynamic chromatic number χd(G). We prove in this paper the following best possible upper bounds as an analogue to Brook’s Theorem, together with the determination of chromatic...
متن کاملOn the upper chromatic index of a multigraph
We consider the colorings of the edges of a multigraph in such a way that every non-pendant vertex is incident to at least two edges of the same color. The maximum number of colors that can be used in such colorings is the upper chromatic index of a multigraph G, denoted by χ̄(G). We prove that if a multigraph G has n vertices, m edges, p pendant vertices and maximum c disjoint cycles, then χ̄(G)...
متن کاملUpper and lower bounds of symmetric division deg index
Symmetric Division Deg index is one of the 148 discrete Adriatic indices that showed good predictive properties on the testing sets provided by International Academy of Mathematical Chemistry. Symmetric Division Deg index is defined by $$ SDD(G) = sumE left( frac{min{d_u,d_v}}{max{d_u,d_v}} + frac{max{d_u,d_v}}{min{d_u,d_v}} right), $$ where $d_i$ is the degree of vertex $i$ in graph $G$. In th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 2018
ISSN: 0364-9024,1097-0118
DOI: 10.1002/jgt.22429