Results 1 to 10 of about 57,891 (276)
Strong Chromatic Index of Outerplanar Graphs
Axioms, 2022 The strong chromatic index χs′(G) of a graph G is the minimum number of colors needed in a proper edge-coloring so that every color class induces a matching in G. It was proved In 2013, that every outerplanar graph G with Δ≥3 has χs′(G)≤3Δ−3.
Ying Wang +3 more
doaj +2 more sources
Algorithms for computing chromatic polynomials and chromatic index polynomials
Scientific AfricanObjectives: The aim of this article is to enhance the understanding of the computation of chromatic polynomials and chromatic index polynomials, and to facilitate their practical use in various fields by demonstrating and supporting the proposed ...
Lateram Zawuga Hordofa +2 more
doaj +2 more sources
Fuzzy coloring and total fuzzy coloring of various types of intuitionistic fuzzy graphs [PDF]
Notes on IFS, 2023 In this paper, fuzzy coloring and total fuzzy coloring of intuitionistic fuzzy graphs are introduced. The fuzzy chromatic number, fuzzy chromatic index, total fuzzy chromatic number and total fuzzy chromatic index of both vertices and edges in ...
R. Buvaneswari, P. Revathy
doaj +1 more source
Construction and analysis of graph models for multiprocessor interconnection networks [PDF]
Yugoslav Journal of Operations Research, 2022 A graph G can serve as a model for the Multiprocessor Interconnection Networks (MINs) in which the vertices represent the processors, while the edges represent connections between processors.
Hegde S.M., Saumya Y.M.
doaj +1 more source
From light edges to strong edge-colouring of 1-planar graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 A strong edge-colouring of an undirected graph $G$ is an edge-colouring where every two edges at distance at most~$2$ receive distinct colours. The strong chromatic index of $G$ is the least number of colours in a strong edge-colouring of $G$.
Julien Bensmail +3 more
doaj +1 more source
On the Chromatic Index of the Signed Generalized Petersen Graph GP(n,2)
Axioms, 2022 Let G be a graph and σ:E(G)→{+1,−1} be a mapping. The pair (G,σ), denoted by Gσ, is called a signed graph. A (proper) l-edge coloring γ of Gσ is a mapping from each vertex–edge incidence of Gσ to Mq such that γ(v,e)=−σ(e)γ(w,e) for each edge e=vw, and no
Shanshan Zheng +3 more
doaj +1 more source
Strong chromatic index of products of graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 The strong chromatic index of a graph is the minimum number of colours needed to colour the edges in such a way that each colour class is an induced matching.
Olivier Togni
doaj +2 more sources
Chromatic index determined by fractional chromatic index [PDF]
Journal of Combinatorial Theory, Series B, 2018 Given a graph $G$ possibly with multiple edges but no loops, denote by $ $ the {\it maximum degree}, $ $ the {\it multiplicity}, $ '$ the {\it chromatic index} and $ _f'$ the {\it fractional chromatic index} of $G$, respectively. It is known that $ \le _f' \le ' \le + $, where the upper bound is a classic result of Vizing.
Chen, Guantao +4 more
openaire +2 more sources
Acyclic chromatic index of chordless graphs
Discrete Mathematics, 2023 An acyclic edge coloring of a graph is a proper edge coloring in which there are no bichromatic cycles. The acyclic chromatic index of a graph $G$ denoted by $a'(G)$, is the minimum positive integer $k$ such that $G$ has an acyclic edge coloring with $k$ colors.
Basavaraju, Manu +2 more
openaire +2 more sources
On Proper (Strong) Rainbow Connection of Graphs
Discussiones Mathematicae Graph Theory, 2021 A path in an edge-colored graph G is called a rainbow path if no two edges on the path have the same color. The graph G is called rainbow connected if between every pair of distinct vertices of G, there is a rainbow path.
Jiang Hui +3 more
doaj +1 more source