compatibility graph of non-crossing matchings of points in convex position.
14] constructed super (a, d ) -edge- antimagic total labeling for w -trees and extended w -trees as well as super (a, d ) -edge-antimagic total labeling for disjoint union of isomorphic and non-isomorphic copies of
In this paper, we formulate cycle anti-supermagic labeling for the disjoint union of isomorphic copies of ladder graphs for different value of d .
Thus G and X - U are disjoint
vg-open sets containing x and y respectively.
11 of , there exists a disjoint
positive sequence ([y.
40, a set X being infinite, it can be expressed as a disjoint
union of a class C of countably infinite sets that is, each of which has cardinality [omega].
5, 1]) are disjoint
open sets containing C and Fr(O), respectively.
Whether or not such a connection ultimately becomes established and accepted by medical scientists, it seems clear, in any event, that complementary but disjoint
literatures are worth seeking; in principle they hold the potential for stimulating the process of scientific discovery.
Enomoto, On the existence of disjoint
cycles in a graph, Combinatorica 18 (1998), 487-492.
In , QoS design issues related to the optimal disjoint
paths establishment were investigated.
2], there exist disjoint
v--open sets U and V in X such that x [member of] U, y [not member of] U and y [member of] V, x [not member of] V.
In Section 2, we recall the definition and properties of Cartesian product graphs, and give some basic results about the internally disjoint