set of vertices
Vol 8, No 8 (2017)
... The set of vertices and the set of edges of a graph G will be denoted by V(G) and E(G) respectively and let π = |V(G)| , π = ...a set of elements(usually vertices and /or edges) into a ...
6
Some Cordial Labeling of Duplicate Graph of Ladder Graph
... the vertices or edges or both subject to certain ...the set of vertices (or edges), then the labeling is called a vertex labeling (or an edge ...
8
The Upper Total Edge Domination Number of a Graph
... the set of all leaves of a graph ...connected.A set of vertices in a graph is a dominating set if each vertex of is dominated by some vertex of ...dominating set of .A total dominating ...
6
Generalized Zagreb index of V phenylenic nanotubes and nanotori
... of vertices of G. Let G be a graph with the set of vertices V(G) and the set of edges E(G) and r and s are two arbitrary non-negative integer, then the Generalized Zagreb index of G is defined ...
5
Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs
... Independent Set are two of the most well-studied NP-complete ...independent set of a graph is a set of vertices no two of which are connected by an edge, and that a vertex cover is a ...
17
International Journal of Scientific Research and Reviews The Upper Total Edge Domination Number of a Graph
... the set of all leaves of a graph ...connected.A set of vertices in a graph is a dominating set if each vertex of is dominated by some vertex of ...dominating set of .A total dominating ...
6
Uniform set labeling vertices to ensure adjacency coincides with disjointness
... whose vertices correspond to the k element subsets of an n element set and two vertices are adjacent precisely when their corresponding subsets are dis- ...independent set of ...this ...
17
Some Properties of Glue Graph
... the vertices of G and is denoted by Ξ΄ (G); the maximum degree of G denoted by β ...A set of vertices which covers all the edges of a graph G is called a vertex cover for G, while a set of ...
6
THE STRONG (WEAK) VV-DOMINATING SET OF A GRAPH
... Two vertices π’, π€ β π vv-dominate each other if they incident on the same ...A set of vertices is said to be strong vv-dominating set if each vertex outside the set is strongly ...
10
Minimum Rank of Graphs Powers Family
... vertex set E, with two vertices in adjacent if and only if the corresponding edges share an endpoint in ...nonempty set of vertices, the line graph is de- fined only for a graph G that has at ...
5
Total Bondage Number Of A Butterfly Graph
... ABSTRACT:- Domination Theory is an important branch of Graph Theory that has wide range of applications to various branches of Science and Technology. A new family of graphs called Butterο¬ y Graphs is introduced recently ...
6
Chain event graphs : theory and application
... The set of intermediate vertices of T- Definition 2 An edge joining vertices v and v' An Augmented Tree Definition 7 A subtree of T defined in Definition 27 A subtree of T described in s[r] ...
208
A polynomial turing-Kernel for weighted independent set in bull-free graphs
... Somewhat surprisingly, the non existence of a polynomial kernel is not related to the hard core of the algorithm (computing the leaves) but is related to the decomposition tree itself (since even complete sums cannot be ...
20
Vol 9, No 1 (2018)
... dominating set, complementary pendent dominating set, isolate dominating set, doubly isolate dominating set, perfect secure dominating set which have since been ...of vertices, ...
6
Which fullerenes are stable?
... of vertices and faces: the vertex set of the dual graph is the set of faces of the original graph and two vertices in the dual graph are adjacent if and only if the two faces share an edge in ...
7
A Note on a graph associated to a commutative ring
... distinct vertices of G are adjacent in G [4, Definition ...the set of all vertices of G and the set of all edges of G by V (G) and E(G) ...
22
On the Graceful Cartesian Product of Alpha-Trees
... Ξ±-graph. Thus, this argument can be used to prove that all trees with up to four leaves are graceful; some special cases need ad hoc arguments. Extending the result in [1], it is possible to prove that any fence, ...
13
Arithmetic labeling of w4Γ pn and km,n
... Acharya.B.D. and Hedge.S.M.was introduced the concept of arithmetic labeling and many research articles have published in this topic. In this paper, we have proved that the for every m,n > 0 are arithmetic graphs. ...
8
First order convergence and roots
... Theorem 1 follows from a more general Theorem 5 which we prove in Section 3. In Section 4, we present an example that the statement of Theorem 1 cannot be strengthened to all vertices v of M , i.e., the answer to ...
11
On Qlick Transformation Graphs
... corresponding vertices of edges of G are not mutually adjacent in G β β + ...corresponding vertices of blocks of G are not mutually adjacent in G β β + ...
7