complete bipartite graphs
Balanced Degree-Magic Labelings of Complete Bipartite Graphs under Binary Operations
... vertex-disjoint graphs G and H , the composition of graphs G and H , denoted by G·H, is a graph such that the vertex set of G·H is the Cartesian product V (G) × V (H ) and any two vertices (u, v) and (x, y) ...
13
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
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 ...
16
Schultz and Modified Schultz Polynomials of Cog-Complete Bipartite Graphs
... Abstract: Let G be a simple connected graph, the vertex- set and edge- set of G are denoted by V(G) and E(G), respectively. The molecular graph G, the vertices represent atoms and the edges represent bonds. In graph ...
6
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
Mixed cycle-E-super magic decomposition of complete bipartite graphs
... with one isolated vertex, grids and books. Maryati et al. [16] studied the H-super magic labeling of some graphs obtained from k isomorphic copies of a connected graph H. In 2012, Mania Roswitha and Edy Tri ...
16
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
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
Super Edge-antimagic Graceful labeling of Graphs
... graceful graphs is a generalization of the article ...graceful graphs, ...of graphs, including complete graphs and complete bipartite ...
6
Approaches for Graphs Near Structural Classes.
... (complete bipartite graphs) naturally arise in many data mining applications, including detecting cyber communities [ Kum99 ] , data compression [ Aga94 ] , epidemiology [ Mus07 ] , artificial ...
94
On Cartesian Products of Orthogonal Double Covers
... Let 𝐻 be a graph on 𝑛 vertices and G a collection of 𝑛 subgraphs of 𝐻, one for each vertex, where G is an orthogonal double cover (ODC) of 𝐻 if every edge of 𝐻 occurs in exactly two members of G and any two members share ...
5
NEW RESULTS ON SUPER EDGE MAGIC DEFICIENCY OF KITE GRAPHS
... provided the exact values for the super edge magic deficiencies of several classes of graphs, such as cycles, complete graphs, 2-regular graphs, and complete bipartite graphs K 2,m.. The[r] ...
12
Mod difference labeling of some classes of digraphs
... difference graphs similar to sum graphs and similar works we refer [8, ...difference graphs (paths, trees, cycles, special wheels, com- plete graphs, complete bipartite ...
5
On star polynomials, graphical partitions and reconstruction
... J., On a Class of Polynomials Associated with the Stars of a Graph and its Application to Node Disjoint Decompositions of Complete Graphs and Complete Bipartite Graphs into Stars, Canad.[r] ...
7
Distinguishing Number and Distinguishing Index of the Join of Two Graphs
... in [8]. The distinguishing number and index of the Cartesian product and the Cartesian powers of graphs has been thoroughly investigated [1, 9, 5]. Pilśniak studied the Nordhaus-Gaddum bounds for the ...
13
Hamming distance between the strings generated by adjacency matrix of a graph and their sum
... neighbours and non-common neighbours. Results of Section 4 gives the sum of Hamming distances between all pairs of strings generated by the adjacency matrix for some standard graphs like complete graph, ...
12
Automorphism Groups Of Weakly Semi-Regular Bipartite Graphs
... Proof: Let G be a weakly semi-regular bipartite graph with k- NSD subparts. Let X and Y be the parts of G. Since it has k- NSD subparts, |𝑋| ≠ |𝑌|. Let |𝑋| < |𝑌| . This implies that for all 𝑥 ∈ 𝑋 and 𝑦 ∈ 𝑌 , ...
5
Integer-antimagic spectra of disjoint unions of cycles
... The concept of the A-antimagicness property for a graph G (introduced in [2]) naturally arises as a variation of the A-magic labeling problem (where the induced vertex labeling is a constant map) (for example, see [4–6, ...
14
The $ k $-${\rm \bf{ th}}$ spectral moment of signed complete graphs
... Let G = (V (G), E(G)) be a simple graph with the vertex set V (G) and the edge set E(G) where |E(G)| ≥ 1. The order of G is defined to be |V (G)| and if the degree of a vertex u of G is 1, then u is called a pendant ...
10
Szeged index of bipartite unicyclic graphs
... n e G n e G over all edges e uv of G , where n e G 1 ( | ) and n e G 2 ( | ) are respectively the number of vertices of G lying closer to vertex u than to vertex v and the number of vertices of G lying closer to vertex ...
12