Institutul de Matematică şi Informatică "Vladimir Andrunachievici"
Universitatea de Stat din MoldovaRO EN
On the upper chromatic index of a multigraph
Authors: Mario Gionfriddo, Lorenzo Milazzo, Vitaly Voloshin
– 0.14 Mb
Abstract
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 not(χ')(G). We prove that if a multigraph G has n vertices, m edges, p pendant vertices and maximum number c disjoint cycles, then not(χ')(G) = c + m - n + pM.Gionfriddo, L.Milazzo, V.Voloshin,
Mario Gionfriddo, Lorenzo Milazzo
Dipartimento di Matematica e Informatica,
Universita di Catania,
Viale A.Doria, 6 95125 - Catania, Italia.
E-mail:
E-mail:
Vitaly Voloshin
Institute of Mathematics and Computer Science
of Moldovan Academy of Sciences,
str. Academiei 5, Chisinau,
MD-2028, Moldova.
E-mail:
Mario Gionfriddo, Lorenzo Milazzo
Dipartimento di Matematica e Informatica,
Universita di Catania,
Viale A.Doria, 6 95125 - Catania, Italia.
E-mail:
E-mail:
Vitaly Voloshin
Institute of Mathematics and Computer Science
of Moldovan Academy of Sciences,
str. Academiei 5, Chisinau,
MD-2028, Moldova.
E-mail:
Fulltext
– 0.14 Mb
Contents
- Personal Reflections on a Joyful Occasion
- Fuzzy Sets-based Control Rules for Terminating Algorithms
- Evolutionary Design of Very Compact Analog Circuit Implementations of Fuzzy Systems
- Perceived Fuzzy Subsets of Finite Sets
- The digital technologies as the chance for sustainable development of Moldova
- Analytical space for data representation and interactive analysis
- On the upper chromatic index of a multigraph
- A note on the colorability of mixed hypergraph using k colors
