نتایج جستجو برای: completely e closed graph
تعداد نتایج: 1431890 فیلتر نتایج به سال:
A graph G is arbitrarily decomposable into closed trails (ADCT) if the following is true: Whenever (l1, . . . , lp) is a sequence of integers adding up to |E(G)| and there is a closed trail of length li in G for i = 1, . . . , p, then there is a sequence (T1, . . . , Tp) of pairwise edge-disjoint closed trails in G such that Ti is of length li for i = 1, . . . , p. In the paper it is proved tha...
A list assignment of a graph G = (V,E) is a function L that assigns a list L(u) of so-called admissible colors to each u ∈ V . The List Coloring problem is that of testing whether a given graph G = (V,E) has a coloring c that respects a given list assignment L, i.e., whether G has a mapping c : V → {1, 2, . . .} such that (i) c(u) 6= c(v) whenever uv ∈ E and (ii) c(u) ∈ L(u) for all u ∈ V . If ...
For a graph G = (V,E), a non-empty set S ⊆ V is a global offensive alliance if for every v ∈ V − S, at least half of the vertices from the closed neighborhood of v are in S. A set S ⊆ V is a global strong offensive alliance if for each vertex v ∈ V −S, a strict majority of the vertices of the closed neighborhood of v are in S. The cardinality of a minimum global (strong) offensive alliance of a...
In this paper we define a new labeling called skolem odd difference mean labeling and investigate skolem odd difference meanness of some standard graphs. Let G = (V,E) be a graph with p vertices and q edges. G is said be skolem odd difference mean if there exists a function f : V (G) → {0, 1, 2, 3, . . . , p + 3q − 3} satisfying f is 1−1 and the induced map f : E(G) → {1, 3, 5, . . . , 2q−1} de...
for a graph $g$ with edge set $e(g)$, the multiplicative sum zagreb index of $g$ is defined as$pi^*(g)=pi_{uvin e(g)}[d_g(u)+d_g(v)]$, where $d_g(v)$ is the degree of vertex $v$ in $g$.in this paper, we first introduce some graph transformations that decreasethis index. in application, we identify the fourteen class of trees, with the first through fourteenth smallest multiplicative sum zagreb ...
A domination graph of a digraph D, dom (D), is created using thc vertex set of D and edge uv E E (dom (D)) whenever (u, z) E A (D) or (v, z) E A (D) for any other vertex z E V (D). Here, we consider directed graphs whose underlying graphs are isomorphic to their domination graphs. Specifically, digraphs are completely characterized where UG (D) is the union of two disjoint paths.
Abstract Due to the presence of two opposite directional thinking in relationships between countries and communication systems, systems may not always be balanced. Therefore, perfectness relations are highly important. It comes from how much they were connected each other for communication. In this study, first perfectly regular bipolar fuzzy graph is introduced examined regularity nodes. Then,...
in this paper we define a new labeling called skolem odd difference mean labeling and investigate skolem odd difference meanness of some standard graphs. let g = (v,e) be a graph with p vertices and q edges. g is said be skolem odd difference mean if there exists a function f : v (g) → {0, 1, 2, 3, . . . , p + 3q − 3} satisfying f is 1−1 and the induced map f : e(g) → {1, 3, 5, . . . , 2q−1} d...
We define the notions tree-depth and upper chromatic number of a graph and show their relevance to local–global problems for graph partitions. In particular we show that the upper chromatic number coincides with the maximal function which can be locally demanded in a bounded coloring of any proper minor closed class of graphs. The rich interplay of these notions is applied to a solution of boun...
let g(v,e) be a graph with p vertices and q edges. a graph g is said to have an odd mean labeling if there exists a function f : v (g) → {0, 1, 2,...,2q - 1} satisfying f is 1 - 1 and the induced map f* : e(g) → {1, 3, 5,...,2q - 1} defined by f*(uv) = (f(u) + f(v))/2 if f(u) + f(v) is evenf*(uv) = (f(u) + f(v) + 1)/2 if f(u) + f(v) is odd is a bijection. a graph that admits an odd mean lab...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید