Results 31 to 40 of about 15,555,412 (284)
PEWARNAAN TITIK TOTAL SUPER ANTI-AJAIB LOKAL PADA GRAF PETERSEN DIPERUMUM P(n,k) DENGAN k=1,2
Barekeng, 2021 The local antimagic total vertex labeling of graph G is a labeling that every vertices and edges label by natural number from 1 to such that every two adjacent vertices has different weights, where is The sum of a vertex label and the labels of all ...
Deddy Setyawan +4 more
doaj +1 more source
The total-chromatic number of some families of snarks [PDF]
, 2011 The total-chromatic number χT(G) is the least number of colours needed to colour the vertices and edges of a graph G such that no incident or adjacent elements (vertices or edges) receive the same colour.
de Mello, C.P. +5 more
core +2 more sources
Determining equitable total chromatic number for infinite classes of complete r-partite graphs
Discrete Applied Mathematics, 2020 An equitable total coloring is the assignment of colors to the edges and vertices of a graph G so that incident and adjacent elements receive different colors, and the difference between the cardinalities of any two color classes is either 0 or 1.
Anderson G. da Silva +2 more
semanticscholar +1 more source
On the r-dynamic coloring of some fan graph families
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2021 In this paper, we determine the r-dynamic chromatic number of the fan graph Fm,n and determine sharp bounds of this graph invariant for four related families of graphs: The middle graph M(Fm,n), the total graph T (Fm,n), the central graph C(Fm,n) and the
Falcón Raúl M. +3 more
doaj +1 more source
Effect of White and Yellow Background Colour on Short Term Memory: A Cross-over Study [PDF]
Journal of Clinical and Diagnostic Research, 2021 Introduction: Colour has a potential influence on learning by improving Short Term Memory (STM) in different settings. Background colours of study materials can have an impact on STM in healthy student population. Enhanced memory can improve academic
Mithun S Acharya +3 more
doaj +1 more source
Recent results on the total chromatic number [PDF]
, 1993 We give a survey of various recent results concerning the total chromatic number of simple ...
Hilton, A.J.W.
core +1 more source
On the total and AVD-total coloring of graphs
AKCE International Journal of Graphs and Combinatorics, 2020 A total coloring of a graph G is an assignment of colors to the vertices and the edges such that (i) no two adjacent vertices receive same color, (ii) no two adjacent edges receive same color, and (iii) if an edge e is incident on a vertex v, then v and ...
B. S. Panda, Shaily Verma, Yash Keerti
doaj +1 more source
Chromatic Properties of the Pancake Graphs
Discussiones Mathematicae Graph Theory, 2017 Chromatic properties of the Pancake graphs Pn, n ⩾ 2, that are Cayley graphs on the symmetric group Symn generated by prefix-reversals are investigated in the paper.
Konstantinova Elena
doaj +1 more source
Neighbor Distinguishing Colorings of Graphs with the Restriction for Maximum Average Degree
Axioms, 2023 Neighbor distinguishing colorings of graphs represent powerful tools for solving the channel assignment problem in wireless communication networks. They consist of two forms of coloring: neighbor distinguishing edge coloring, and neighbor distinguishing ...
Jingjing Huo +3 more
doaj +1 more source
Singed Total Domatic Number of a Graph [PDF]
, 2010 The maximum number of functions in a signed total dominating family on G is the signed total domatic number of G. In this paper, some properties related signed total domatic number and signed total domination number of a graph are studied and found the ...
Shailaja S. Shirkol +2 more
core +1 more source