complete bipartite
Balanced Degree-Magic Labelings of Complete Bipartite Graphs under Binary Operations
... Abstract. A graph is called supermagic if there is a labeling of edges where the edges are labeled with consecutive distinct positive integers such that the sum of the labels of all edges incident with any vertex is ...
13
Some Invariants of Cartesian Product of a Path and a Complete Bipartite Graph
... complete bipartite graph , is a graph whose vertices can be partitioned into subsets , such that no edge has both endpoints in the same subset, and every possible edge that could connect vertices in ...
10
Schultz and Modified Schultz Polynomials of Cog-Complete Bipartite Graphs
... Cog- complete bipartite graph + F, G is the graph constructed from bipartite complete graph + F, , H, ≥ 2 , of vertices set {u , u , … , u , v , v , … , v } with H + − 2 of additional vertices ...
6
Some Sequence of Wrapped Δ Labellings for the Complete Bipartite Graph
... As Figure 1, we present the case = 2 . For example, information disk 1 is associated to the check disks a and c. A 2-dimensional parity code can be modeled by the complete bipartite graph K , = ( U V ...
12
P ⃗ (4k 1) Factorization of Symmetric Complete Bipartite Digraph
... studied by a number of researchers [4, 5, 6, 7, 8]. The necessary and sufficient conditions for the existences of factorization of symmetric complete bipartite digraph were given by Du B [9]. Earlier we ...
5
Two operators on sandpile configurations, the sandpile model on the complete bipartite graph, and a Cyclic Lemma
... By sorted we mean that configuration heights are weakly increasing in each part with respect to vertex indices. This correspondence was shown to have the property that a configuration is recurrent if and only if the ...
29
General Symmetric Starter of Orthogonal Double Covers of Complete Bipartite Graph
... the complete graph is a collection of graphs such that every two of them share exactly one edge and every edge of the complete graph belongs to exactly two of the ...the complete bipartite ...
8
On \(k\)-graceful labeling of pendant edge extension of complete bipartite graphs
... bipartite graph. For all other terminology and notations we follow [2]. A function f is called a graceful labeling of a graph G with m edges if f : V (G) → {0, 1, 2, . . . , m} is injective and the induced ...
12
On Kp,q factorization of complete bipartite multigraphs
... When p = 1 and q is a prime number, Wang, in his paper [On K1,q -factorization of complete bipartite graph, Discrete Math., 126: 1994, 359-364], investigated the K1,q -factorization of K[r] ...
11
Mixed cycle-E-super magic decomposition of complete bipartite graphs
... k, such a labeling is V -super if f (V (G)) = {1, 2, ..., p}. A graph G is called V -super ver- tex magic if it admits a V -super vertex labeling. A vertex magic total labeling is called E-super if f (E(G)) = {1, 2, ..., ...
16
{Ck, Pk, Sk} Decompositions of Balanced Complete Bipartite Multigraphs
... Recently, Lee [15] [16] established necessary and sufficient conditions for the existence of a {Ck , Sk } -decomposition of a complete bipartite graph and {Pk , Sk } -decomposition of a [r] ...
7
P9 factorization of Symmetric Complete Bipartite Digraph
... symmetric complete bipartite digraph were given by Du B ...symmetric complete bipartite digraph [10, ...symmetric complete bipartite digraph, ...
8
The bounds of crossing number in complete bipartite graphs
... Abstract—We compare the lower bound of crossing number of bipartite and complete bipartite graph with Zarankiewicz conjecture and we illustrate the possible upper bound by a modified Zar[r] ...
7
On the existence of degree-magic labellings of the \(n\)-fold self-union of complete bipartite graphs
... In this section we construct supermagic regular graphs by applying the existence of the n-fold self-union of complete bipartite graphs. Herein, we consider the ξ-multiplication of a graph introduced by ...
16
(P 5) Factorization of Complete Bipartite Symmetric Digraphs
... In path factorization, H.Wang [1] gives the necessary and sufficient conditions for the existence of -factorization of a complete bipartite graph for an even integer. Further, Beiling Du [2] extended the ...
6
The embedding of complete bipartite graphs onto grids with a minimum grid cutwidth
... The embedding of complete bipartite graphs onto grids with a The embedding of complete bipartite graphs onto grids with a minimum grid cutwidth.. minimum grid cutwidth.[r] ...
73
Skew Laplacian Energy of Complete Bipartite Digraphs Bilal Chat 1S. Pirzada2
... Let D be a digraph with skew-adjacency matrix S(D). The skew energy of D is defined as the sum of the norms of all eigen values of S(D). Two digraphs are said to be skew equienergetic if their energies are equal. In this ...
5
Vertex Prime Labeling of Union of Complete Bipartite Graphs
... ABSTRACT: A graph G(V, E) is said to have a vertex prime labeling if its edges can be labeled with distinct integers.. from 1, 2, 3,.[r] ...
7
4-Difference Cordial Labeling of Cycle and Wheel Related Graphs
... We consider simple, finite, undirected graph G = (V, E). R. Ponraj, M. Maria Adaickalam and R. Kala [6] introduced k- difference cordial labeling of graphs. In [6], they investigated k-difference cordial labeling ...
5
Minimal congestion trees
... graphs, complete and complete bipartite graphs. For a complete graph with n vertices, we found the specific structure of the minimal congestion ...a complete bipartite graph we ...
64