Results 11 to 20 of about 15,555,412 (284)
TOTAL CHROMATIC NUMBER OF FUZZY BISTAR GRAPH & FUZZY HELM GRAPH
INTERNATIONAL JOURNAL OF MATHEMATICS AND COMPUTER RESEARCH, 2022 Fuzzy total chromatic number is the least value of k such that k-fuzzy total coloring exist. In this paper, we discussed the concept of total coloring of graphs to Fuzzy bistar graph and Fuzzy helm graph.
A. Deebamonica, A. Marydayana
semanticscholar +2 more sources
On the coequal values of total chromatic number and chromatic index [PDF]
J. Comb. Theory B, 2023 The chromatic index χ (cid:48) ( G ) of a graph G is the least number of colors assigned to the edges of G such that no two adjacent edges receive the same color.
Guan-Tao Chen, Yanli Hao
semanticscholar +3 more sources
Total dominator chromatic number of a graph [PDF]
Transactions on Combinatorics, 2015 Given a graph $G$, the total dominator coloring problem seeks a proper coloring of $G$ with the additional property that every vertex in the graph is adjacent to all vertices of a color class. We seek to minimize the number of color classes.
Adel P. Kazemi
doaj +3 more sources
Equitable total chromatic number of splitting graph
Proyecciones (antofagasta), 2019 Among the varius coloring of graphs, the concept of equitable total coloring of graph G is the coloring of all its vertices and edges in which the number of elements in any two color classes differ by atmost one.
G. Jayaraman +2 more
semanticscholar +2 more sources
On the equitable total chromatic number of cubic graphs
Discrete Applied Mathematics, 2016 International audienceA total coloring is equitable if the number of elements colored with each color differs by at most one, and the least integer for which a graph has such a coloring is called its equitable total chromatic number.
S. Dantas +5 more
semanticscholar +2 more sources
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
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
Twin-Lever Multifunctional Meta-Optics With High Longitudinal Tolerance. [PDF]
Adv Sci (Weinh)We introduce a single‐layer, CMOS‐compatible metasurface that allows for polarization‐programmable, achromatic broadband dual‐mode imaging with high longitudinal tolerance. The twin‐lever design combines bright‐field focusing and vortex‐based edge‐enhanced imaging while managing axial intensity distribution from 488 to 633 nm.
Javed I +10 more
europepmc +2 more sources
Total chromatic number for some classes of Cayley graphs [PDF]
Soft Computing - A Fusion of Foundations, Methodologies and Applications, 2020 In this paper, we have obtained the total chromatic number for some classes of Cayley graphs, particularly the Unitary Cayley graphs on even order and some other Circulant graphs.
S. Prajnanaswaroopa +2 more
semanticscholar +1 more source
Equitable Total Coloring of Corona of Cubic Graphs
Discussiones Mathematicae Graph Theory, 2021 The minimum number of total independent partition sets of V ∪ E of a graph G = (V, E) is called the total chromatic number of G, denoted by X′(G). If the di erence between cardinalities of any two total independent sets is at most one, then the minimum ...
Furmańczyk Hanna, Zuazua Rita
doaj +1 more source