Results 1 to 10 of about 34,319 (321)
ON LOCAL IRREGULARITY OF THE VERTEX COLORING OF THE CORONA PRODUCT OF A TREE GRAPH [PDF]
Ural Mathematical Journal, 2022 Let \(G=(V,E)\) be a graph with a vertex set \(V\) and an edge set \(E\). The graph \(G\) is said to be with a local irregular vertex coloring if there is a function \(f\) called a local irregularity vertex coloring with the properties: (i) \(l:(V(G ...
Arika Indah Kristiana +5 more
doaj +2 more sources
Vertex-Distinguishing IE-Total Colorings of Complete Bipartite Graphs Km,N(m < n) [PDF]
Discussiones Mathematicae Graph Theory, 2013 Let G be a simple graph. An IE-total coloring f of G is a coloring of the vertices and edges of G so that no two adjacent vertices receive the same color. Let C(u) be the set of colors of vertex u and edges incident to u under f. For an IE-total coloring
Chen Xiang’en, Gao Yuping, Yao Bing
doaj +2 more sources
Strong parity vertex coloring of plane graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 A strong parity vertex coloring of a 2-connected plane graph is a coloring of the vertices such that every face is incident with zero or an odd number of vertices of each color.
Tomas Kaiser +3 more
doaj +3 more sources
Colorful Paths in Vertex Coloring of Graphs [PDF]
The Electronic Journal of Combinatorics, 2011 A colorful path in a graph $G$ is a path with $\chi(G)$ vertices whose colors are different. A $v$-colorful path is such a path, starting from $v$. Let $G\neq C_7$ be a connected graph with maximum degree $\Delta(G)$. We show that there exists a $(\Delta(G)+1)$-coloring of $G$ with a $v$-colorful path for every $v\in V(G)$.
Saieed Akbari +2 more
openalex +3 more sources
Hierarchical and modularly-minimal vertex colorings
The Art of Discrete and Applied Mathematics, 2022 Cographs are exactly the hereditarily well-colored graphs, i.e., the graphs for which a greedy vertex coloring of every induced subgraph uses only the minimally necessary number of colors $χ(G)$. We show that greedy colorings are a special case of the more general hierarchical vertex colorings, which recently were introduced in phylogenetic ...
Dulce I. Valdivia +4 more
openalex +4 more sources
LOCAL IRREGULARITY VERTEX COLORING OF BICYCLIC GRAPH FAMILIES
BarekengThe graph in this research is a simple and connected graph with as vertex set and as an edge set. We used deductive axiomatic and pattern recognition method.
Arika Indah Kristiana +5 more
doaj +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
An Inclusive Local Irregularity Vertex Coloring of Dutch Windmill Graph
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2023 Let G(V,E) is a simple and connected graph with V(G) as vertex set and E(G) as edge set. An inclusive local irregularity vertex coloring is a development of the topic of local irregularity vertex coloring. An inclusive local irregularity vertex coloring
Arika Indah Kristiana +2 more
doaj +1 more source
Distinguishing colorings of graphs and their subgraphs
AIMS Mathematics, 2023 In this paper, several distinguishing colorings of graphs are studied, such as vertex distinguishing proper edge coloring, adjacent vertex distinguishing proper edge coloring, vertex distinguishing proper total coloring, adjacent vertex distinguishing ...
Baolin Ma, Chao Yang
doaj +1 more source
on Graceful Chromatic Number of Vertex amalgamation of Tree Graph Family
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2022 Proper vertex coloring c of a graph G is a graceful coloring if c is a graceful k-coloring for k∈{1,2,3,…}. Definition graceful k-coloring of a graph G=(V,E) is a proper vertex coloring c:V(G)→{1,2,…,k);k≥2, which induces a proper edge coloring c':E(G ...
Arika Indah Kristiana +3 more
doaj +1 more source