نتایج جستجو برای: graph labeling
تعداد نتایج: 252636 فیلتر نتایج به سال:
For example is a chromatic number with the smallest integer so that graph has true vertex coloring k color. Chromatic still an interesting study which being studied for its development through coloring. Graph special case of labeling. Labeling here means, giving color to points at certain limit no two vertices have same This aims calculate in several classes graphs including , Based on results ...
A Roman dominating function (RDF) on a graph $G = (V, E)$ is a labeling $f : V rightarrow {0, 1, 2}$ suchthat every vertex with label $0$ has a neighbor with label $2$. The weight of $f$ is the value $f(V) = Sigma_{vin V} f(v)$The Roman domination number, $gamma_R(G)$, of $G$ is theminimum weight of an RDF on $G$.An RDF of minimum weight is called a $gamma_R$-function.A graph G is said to be $g...
An almost-bipartite graph is a non-bipartite graph with the property that the removal of a particular single edge renders the graph bipartite. A graph labeling of an almost-bipartite graph G with n edges that yields cyclic G-decompositions of the complete graph K2nt+1 was recently introduced by Blinco, El-Zanati, and Vanden Eynden. They called such a labeling a γ-labeling. Here we show that the...
In this paper, we focus on one type of labeling is called range labeling, have introduced for certain graphs as Pz, Cz, Sy,z(Double star), sun graph and some trees.
Graph labeling is considered as one of the most interesting areas in graph theory. A for a simple G (numbering or valuation), an association non -negative integers to vertices G  (vertex labeling) edges (edge both them. In this paper we study graceful k- uniform hypertree and define condition corresponding tree be graceful. if minimum difference vertices’ labels each edge dis...
For a connected graph G of order n ≥ 3, let f : E(G) → Zn be an edge labeling of G. The vertex labeling f ′ : V (G) → Zn induced by f is defined as f (u) = ∑ v∈N(u) f(uv), where the sum is computed in Zn. If f ′ is one-to-one, then f is called a modular edge-graceful labeling and G is a modular edge-graceful graph. A modular edge-graceful labeling f of G is nowhere-zero if f(e) 6= 0 for all e ∈...
Let be a graph with and are the set of its vertices edges, respectively. Total edge irregular -labeling on is map from to satisfies for any two distinct edges have weights. The minimum which labeling spoken as strength total labeling, represented by . In this paper, we discuss tes triangular grid graphs, spanning subgraphs, Sierpiński gasket graphs.
Recently three prime cordial labeling behavior of path, cycle, complete graph, wheel, comb, subdivison of a star, bistar, double comb, corona of tree with a vertex, crown, olive tree and other standard graphs were studied. Also four prime cordial labeling behavior of complete graph, book, flower were studied. In this paper, we investigate the four prime cordial labeling behavior of corona of wh...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید