Results 51 to 60 of about 5,252 (152)
Results in EngineeringA drug molecule can be represented as an isomorphic molecular graph G(V, E), where the atoms form the vertex set V(G) and bonds between atoms constitute the edge set E(G). Topological indices are numerical values computed from isomorphic molecular graphs
C. Yogalakshmi, B. J. Balamurugan
doaj +1 more source
Strong List Edge Coloring of Subcubic Graphs
, 2020 We study strong list edge coloring of subcubic graphs, and we prove that every subcubic graph with maximum average degree less than 15/7, 27/11, 13/5, and 36/13 can be strongly list edge colored with six, seven, eight, and nine colors ...
Zhengke Miao +4 more
core
Large rainbow matchings in semi-strong edge-colorings of graphs
, 2018 The lower bounds for the size of maximum rainbow matching in properly edge-colored graphs have been studied deeply during the last decades. An edge-coloring of a graph [Formula: see text] is called a strong edge-coloring if each path of length at most ...
Zemin Jin, Kun Ye, He Chen, Yuefang Sun
core +1 more source
Scientific ReportsGreen products such as plant tints are becoming more and more well-known worldwide due to their superior biological and ayurvedic properties. In this work, colorant from Amba Haldi (Curcuma aromatica) was isolated using microwave (MW), and bio-mordants ...
Noman Habib +6 more
doaj +1 more source
The Strong Edge-Coloring of Graphs
A proper edge-coloring of a graph G is called a strong edge-coloring if any two edges joined by another edge receive distinct colors. It is clear that in a strong edge-coloring, every color class forms an induced matching.
Zhou, Xiangqian
core
Adjacent strong edge-coloring of split graphs
, 2018 Orientador: Célia Picinin de MelloDissertação (mestrado) - Universidade Estadual de Campinas, Instituto de ComputaçãoResumo: Seja G um grafo simples. Uma coloração de arestas semiforte de G é uma coloração de arestas de G onde para cada par de vértices ...
Vilas-Bôas, Aloísio de Menezes, 1987-
core
Edge coloring of products of signed graphs
In 2020, Behr defined the problem of edge coloring of signed graphs and showed that every signed graph $(G, \sigma)$ can be colored using exactly $\Delta(G)$ or $\Delta(G) + 1$ colors, where $\Delta(G)$ is the maximum degree in graph $G$. In this paper,
Wróblewski, Bartłomiej +2 more
core +2 more sources
New Concepts on Vertex and Edge Coloring of Simple Vague Graphs
, 2018 The vague graph has found its importance as a closer approximation to real life situations. A review of the literature in this area reveals that the edge coloring problem for vague graphs has not been studied until now.
P. K. Kishore Kumar +4 more
core +1 more source
Θ-graphs of partial cubes and strong edge colorings
Electronic Notes in Discrete Mathematics, 2007 Abstract It was conjectured in [5] that the upper bound for the strong chromatic index s ′ ( G ) of bipartite graphs is Δ ( G ) 2 , where Δ ( G ) is the largest degree of vertices in G. In this note we study the strong edge coloring of some classes of bipartite graphs that belong to the class of partial cubes.
openaire +1 more source
Adjacent vertex-distinguishing proper edge-coloring of strong product of graphs
, 2019 Let G be a finite, simple, undirected and connected graph. The adjacent vertex-distinguishing proper edge-coloring is the minimum number of colors required for a proper edge-coloring of G, in which no two adjacent vertices are incident to edges colored ...
Anantharaman, S.
core