نتایج جستجو برای: vertex equitable labeling
تعداد نتایج: 104456 فیلتر نتایج به سال:
A nearly equitable edge-coloring of a multigraph is a coloring such that edges incident to each vertex are colored equitably in number. This problem was solved in O(kn2) time, where n and k are the numbers of the edges and the colors, respectively. The running time was improved to be O(n2/k + n|V |) later. We present a more efficient algorithm for this problem that runs in O(n2/k) time. key wor...
A proper vertex coloring of a graph G is equitable if the sizes of color classes differ by at most one. The equitable chromatic threshold χeq(G) of G is the smallest integer m such that G is equitably n-colorable for all n ≥ m. We show that for planar graphs G with minimum degree at least two, χeq(G) ≤ 4 if the girth of G is at least 10, and χeq(G) ≤ 3 if the girth of G is at least 14.
Let ( , ) G V E be a simple graph. For a total labeling { } : 1,2,3,..., V E k ∂ ∪ → the weight of a vertex x is defined as ( ) ( ) ( ). xy E wt x x xy ∈ = ∂ + ∂ ∑ ∂ is called a vertex irregular total k-labeling if for every pair of distinct vertices x and y, ( ) ( ). wt x wt y ≠ . The minimum k for which the graph G has a vertex irregular total k-labeling is called the total vertex irregularit...
The Graceful Tree Conjecture claims that every finite simple tree of order n can be vertex labeled with integers {1, 2, ...n} so that the absolute values of the differences of the vertex labels of the end-vertices of edges are all distinct. That is, a graceful labeling of a tree is a vertex labeling f , a bijection f : V (Tn) −→ {1, 2, ...n}, that induces an edge labeling g(uv) = |f(u)− f(v)| t...
For a graph G a bijection from the vertex set and the edge set of G to the set {1, 2, . . . , |V (G)| + |E(G)|} is called a total labeling of G. The edge-weight of an edge is the sum of the label of the edge and the labels of the end vertices of that edge. The vertex-weight of a vertex is the sum of the label of the vertex and the labels of all the edges incident with that vertex. A total label...
A graph G is equitably k-colorable if its vertices can be partitioned into k independent sets in such a way that the number of vertices in any two sets differ by at most one. The smallest integer k for which such a coloring exists is known as the equitable chromatic number of G and it is denoted by χ=(G). In this paper the problem of determinig the value of equitable chromatic number for multic...
The local antimagic total vertex labeling of graph G is a that every vertices and edges label by natural number from 1 to such two adjacent has different weights, where sum the labels all incident vertex. If start smallest then edge so kind coloring called super labeling. That induces for v, weight w(v) color v. minimum colors obtained chromatic G, denoted χlsat(G). In this paper, we consider G...
We show that to each graceful labelling of a path on 2s + 1 vertices, s ≥ 2, there corresponds a current assignment on a 3-valent graph which generates at least 22s cyclic oriented triangular embeddings of a complete graph on 12s + 7 vertices. We also show that in this correspondence, two distinct graceful labellings never give isomorphic oriented embeddings. Since the number of graceful labell...
A total labeling of a graph G is a bijection from the vertex set and edge set of G onto the set {1, 2, . . . , |V (G)| + |E(G)|}. Such a labeling ξ is vertex-antimagic (edge-antimagic) if all vertex-weights wtξ(v) = ξ(v) + ∑ vu∈E(G) ξ(vu), v ∈ V (G), (all edge-weights wtξ(vu) = ξ(v) + ξ(vu) + ξ(u), vu ∈ E(G)) are pairwise distinct. If a labeling is simultaneously vertex-antimagic and edge-antim...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید