Results 11 to 20 of about 1,402,601 (292)
The hunting of a snark with total chromatic number 5
Discrete Applied Mathematics, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Diana Sasaki +3 more
openaire +4 more sources
On the equitable total chromatic number of cubic graphs
Discrete Applied Mathematics, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Simone Dantas +5 more
openaire +6 more sources
Total Chromatic Number and Some Topological Indices
Electronic Notes in Discrete Mathematics, 2016 Abstract The total chromatic number χ ″ ( G ) of G is the smallest number of colors needed to color all elements of G in such a way that no adjacent or incident elements get the same color. The harmonic index H ( G ) of a graph G is defined as the sum of the weights 2 d ( u ) + d ( v ) of all edges uv of G, where
J. Geetha 0001, K. Somasundaram 0001
openaire +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
On local antimagic total labeling of complete graphs amalgamation [PDF]
Opuscula Mathematica, 2023 Let \(G = (V,E)\) be a connected simple graph of order \(p\) and size \(q\). A graph \(G\) is called local antimagic (total) if \(G\) admits a local antimagic (total) labeling.
Gee-Choon Lau, Wai Chee Shiu
doaj +1 more source
Total difference chromatic numbers of graphs [PDF]
Involve, a Journal of Mathematics, 2020 18 pages, 11 ...
Rohatgi, Ranjan, Zhang, Yufei
openaire +3 more sources
A Bound on the Total Chromatic Number [PDF]
COMBINATORICA, 1998 A total colouring of a graph \(G\) is an assignment of colours to its vertices and edges so that no two adjacent edges have the same colour, no two adjacent vertices have the same colour, and no edge has the same colour as one of its endpoints. The total chromatic number \(\chi''(G)\) is the least number of colours required for a total colouring of \(G\
Molloy, M., Reed, B.
openaire +2 more sources
Every graph is local antimagic total and its applications [PDF]
Opuscula Mathematica, 2023 Let \(G = (V,E)\) be a simple graph of order \(p\) and size \(q\). A graph \(G\) is called local antimagic (total) if \(G\) admits a local antimagic (total) labeling. A bijection \(g : E \to \{1,2,\ldots,q\}\) is called a local antimagic labeling of \(G\)
Gee-Choon Lau +2 more
doaj +1 more source
Chromatic number of super vertex local antimagic total labelings of graphs
Electronic Journal of Graph Theory and Applications, 2021 Let G(V,E) be a simple graph and f be a bijection f : V ∪ E → {1, 2, …, |V|+|E|} where f(V)={1, 2, …, |V|}. For a vertex x ∈ V, define its weight w(x) as the sum of labels of all edges incident with x and the vertex label itself. Then f is called a super
Fawwaz F. Hadiputra +4 more
doaj +1 more source
Total fuzzy graph coloring [PDF]
Journal of Hyperstructures, 2023 In this paper, a hybrid genetic algorithm (HGA) is proposed for the total fuzzy graph coloring (TFGC) problem. TFGC comprises of a graph with fuzzy vertices and edges, seeks to obtain an optimal $k-$coloring of that fuzzy graph such that the degree of ...
Smriti Saxena +2 more
doaj +1 more source