Results 1 to 10 of about 33,621 (316)

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

Single Valued Neutrosophic R-dynamic Vertex Coloring of Graphs [PDF]

Neutrosophic Sets and Systems, 2022
In 1998, Smarandache introduced the new theory - Neutrosophic sets. In order to achieve the best results in a current situation, policy makers must contend with uncertainty and unpredictability.
V. Aparna, N. Mohanapriya, Said Broumi
doaj   +3 more sources

Vertex-Coloring 2-Edge-Weighting of Graphs [PDF]

, 2010
A $k$-{\it edge-weighting} $w$ of a graph $G$ is an assignment of an integer weight, $w(e)\in \{1,\dots, k\}$, to each edge $e$. An edge weighting naturally induces a vertex coloring $c$ by defining $c(u)=\sum_{u\sim e} w(e)$ for every $u \in V(G)$. A $k$
Lu, Hongliang, Yu, Qinglin, Zhang, Cun-Quan   +2 more
core   +3 more sources

Author Correction: Vertex coloring of graphs via phase dynamics of coupled oscillatory networks. [PDF]

Sci Rep, 2018
Parihar A, Shukla N, Jerry M, Datta S, Raychowdhury A.   +4 more
europepmc   +3 more sources

Analysis of Rainbow Vertex Antimagic Coloring and its Application to Cryptographic Secret Sharing with Affine Cipher Technique

JTAM (Jurnal Teori dan Aplikasi Matematika)
Rainbow vertex antimagic coloring is a novel concept in graph theory that combines rainbow vertex connection with antimagic labeling. Rainbow vertex connection is a vertex coloring where each vertex in a simple connected graph G=(V,E) is connected by a ...
Dafik Dafik, Iftitahul Firdausiyah, Robiatul Adawiyah, Ika Hesti Agustin, Indah Lutfiyatul Mursyidah, Marsidi Marsidi   +5 more
doaj   +2 more sources

Quantum Feasibility Labeling for NP-Complete Vertex Coloring Problem

IEEE Access
Many important science and engineering problems can be converted into NP-complete problems which are of significant importance in computer science and mathematics.
Junpeng Zhan
doaj   +2 more sources

The local vertex anti-magic coloring for certain graph operations. [PDF]

Heliyon
Uma L, Rajasekaran G.
europepmc   +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, Muslihatul Aima, Arika Indah Kristiana   +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, Lusi Rizzami Prahastiwi, Rafiantika Megahnia Prihandini   +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