Results 21 to 30 of about 18,582 (315)
Applications of Graph Coloring [PDF]
, 2005 A graph G is a mathematical structure consisting of two sets V(G) (vertices of G) and E(G) (edges of G). Proper coloring of a graph is an assignment of colors either to the vertices of the graphs, or to the edges, in such a way that adjacent vertices / edges are colored differently.
Ünal Ufuktepe, Goksen Bacak
openaire +2 more sources
A Hybrid Floyd-Warshall and Graph Coloring Algorithm for Finding the Smallest Number of Colors Needed for a Distance Coloring of Graphs [PDF]
Control and Optimization in Applied MathematicsGraph coloring is a crucial area of research in graph theory, with numerous algorithms proposed for various types of graph coloring, particularly graph p-distance coloring.
Hanifa Mosawi +2 more
doaj +1 more source
Labeling, Covering and Decomposing of Graphs — Smarandache’s Notion in Graph Theory [PDF]
, 2010 This paper surveys the applications of Smarandache’s notion to graph theory appeared in International J.Math.Combin. from Vol.1,2008 to Vol.3,2009.
Mao, Linfan, Linfan Mao
core +1 more source
, 2009 For standard terminology and notion in graph theory we refer the reader to Harary [7]; the non-standard will be given in this paper as and when required.
Reddy, P. Siva Kota +3 more
core +1 more source
Triple Connected Domination Number of a Graph [PDF]
, 2012 The concept of triple connected graphs with real life application was introduced by considering the existence of a path containing any three vertices of a graph G.
Selvam Avadayappan +7 more
core +1 more source
Solutions of Some L(2, 1)-Coloring Related Open Problems
Discussiones Mathematicae Graph Theory, 2016 An L(2, 1)-coloring (or labeling) of a graph G is a vertex coloring f : V (G) → Z+ ∪ {0} such that |f(u) − f(v)| ≥ 2 for all edges uv of G, and |f(u)−f(v)| ≥ 1 if d(u, v) = 2, where d(u, v) is the distance between vertices u and v in G.
Mandal Nibedita, Panigrahi Pratima
doaj +1 more source
On Rainbow Antimagic Coloring of Joint Product of Graphs
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2023 Let be a connected graph with vertex set and edge set . A bijection from to the set is a labeling of graph . The bijection is called rainbow antimagic vertex labeling if for any two edge and in path , where and .
Brian Juned Septory +3 more
doaj +1 more source
The H-Line Signed Graph of a Signed Graph [PDF]
, 2010 For standard terminology and notion in graph theory we refer the reader to Harary; the non-standard will be given in this paper as and when required.
Reddy, Siva Kota +2 more
core +1 more source
Orthogonal Colorings of Graphs [PDF]
The Electronic Journal of Combinatorics, 1998 An orthogonal coloring of a graph $G$ is a pair $\{c_1,c_2\}$ of proper colorings of $G$, having the property that if two vertices are colored with the same color in $c_1$, then they must have distinct colors in $c_2$. The notion of orthogonal colorings is strongly related to the notion of orthogonal Latin squares. The orthogonal chromatic number of $G$
Yair Caro, Raphael Yuster
openaire +2 more sources
AN INCLUSIVE LOCAL IRREGULARITY VERTEX COLORING OF BOOK GRAPH FAMILY
Barekeng, 2023 Let is a simple and connected graph with as vertex set and as edge set. Vertex labeling on inclusive local irregularity vertex coloring is defined by mapping and the function of the inclusive local irregularity vertex coloring is with .
Robiatul Adawiyah +2 more
doaj +1 more source