Star-Supermagic Decompositions of the Complete Bipartite Graph Minus a One-Factor
Let G be a graph and let H be a subgraph of G. Assume that G has an H-decomposition T={H1,H2,…,Ht} such that Hi≅H for all 1≤i≤t. An H-supermagic decomposition of G is a bijection f:V(G)∪E(G)→1,2,…,VG+EG such that ∑v∈V(Hi)f(v)+∑e∈E(Hi)f(e) is a constant k for each Hi in the decomposition T and fVG=1,...
Saved in:
Main Authors: | Tanawat Wichianpaisarn, Uthoomporn Mato |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2017-01-01
|
Series: | International Journal of Mathematics and Mathematical Sciences |
Online Access: | http://dx.doi.org/10.1155/2017/5104701 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Fixation Probabilities on Complete Star and Bipartite Digraphs
by: Chunming Zhang, et al.
Published: (2012-01-01) -
A Novel Approach for Cyclic Decompositions of Balanced Complete Bipartite Graphs into Infinite Graph Classes
by: A. El-Mesady, et al.
Published: (2022-01-01) -
General Symmetric Starter of Orthogonal Double Covers of Complete Bipartite Graph
by: R. A. El-Shanawany, et al.
Published: (2007-01-01) -
Algorithmic aspects of bipartite graphs
by: Mihály Bakonyi, et al.
Published: (1995-01-01) -
Longest cycles in certain bipartite graphs
by: Pak-Ken Wong
Published: (1998-01-01)