Results 31 to 40 of about 44,462 (291)
Journal of Combinatorial Theory, Series B, 1993 AbstractWe show that as n → ∞ the proportion of graphs on vertices 1, 2, ..., n with total chromatic number χ″ > Δ + 1 is very small; and the proportion with χ″ > Δ + 2 is very very small. Here Δ denotes the maximum vertex degree. We also give an easy new deterministic upper bound on χ″ (proved randomly).
Colin J. H. McDiarmid, Bruce A. Reed
openaire +1 more source
Labeling, Covering and Decomposing of Graphs — Smarandache’s Notion in Graph Theory [PDF]
, 2010 This paper surveys the applications of Smarandache’s notion to graph theory appeared in International J.Math.Combin. from Vol.1,2008 to Vol.3,2009.
Mao, Linfan, Linfan Mao
core +1 more source
On (p, 1)-Total Labelling of Some 1-Planar Graphs
Discussiones Mathematicae Graph Theory, 2021 A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, it is proved that the (p, 1)-total labelling number (p ≥ 2) of every 1-planar graph G is at most Δ(G) + 2p − 2 provided that Δ (G) ≥
Niu Bei, Zhang Xin
doaj +1 more source
On a Total Version of 1-2-3 Conjecture
Discussiones Mathematicae Graph Theory, 2020 A total k-coloring of a graph G is a coloring of vertices and edges of G using colors of the set {1, . . . , k}. These colors can be used to distinguish adjacent vertices of G. There are many possibilities of such a distinction.
Baudon Olivier +5 more
doaj +1 more source
Complexity of Total Dominator Coloring in Graphs
Graphs and Combinatorics, 2023 Let $G=(V,E)$ be a graph with no isolated vertices. A vertex $v$ totally dominate a vertex $w$ ($w \ne v$), if $v$ is adjacent to $w$. A set $D \subseteq V$ called a total dominating set of $G$ if every vertex $v\in V$ is totally dominated by some vertex in $D$. The minimum cardinality of a total dominating set is the total domination number of $G$ and
Michael A. Henning +3 more
openaire +2 more sources
Total Minimal Dominating Signed Graph [PDF]
, 2010 Cartwright and Harary considered graphs in which vertices represent persons and the edges represent symmetric dyadic relations amongst persons each of which designated as being positive or negative according to whether the nature of the relationship is ...
Reddy, Siva Kota, Vijay, S.
core +1 more source
Neighbor Product Distinguishing Total Colorings of Planar Graphs with Maximum Degree at least Ten
Discussiones Mathematicae Graph Theory, 2021 A proper [k]-total coloring c of a graph G is a proper total coloring c of G using colors of the set [k] = {1, 2, . . . , k}. Let p(u) denote the product of the color on a vertex u and colors on all the edges incident with u.
Dong Aijun, Li Tong
doaj +1 more source
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
Generalized Fractional Total Colorings of Complete Graph
Discussiones Mathematicae Graph Theory, 2013 An additive and hereditary property of graphs is a class of simple graphs which is closed under unions, subgraphs and isomorphism. Let P and Q be two additive and hereditary graph properties and let r, s be integers such that r ≥ s Then an fractional (P,
Karafová Gabriela
doaj +1 more source
Total Rainbow Connection Number of Some Graph Operations
Axioms, 2022 In a graph H with a total coloring, a path Q is a total rainbow if all elements in V(Q)∪E(Q), except for its end vertices, are assigned different colors. The total coloring of a graph H is a total rainbow connected coloring if, for any x,y∈V(H), there is
Hengzhe Li, Yingbin Ma, Yan Zhao
doaj +1 more source