Extreme edge-friendly indices of complete bipartite graphs
Let G=(V,E) be a simple graph. An edge labeling f:E to {0,1} induces a vertex labeling f^+:V to Z_2 defined by $f^+(v)equiv sumlimits_{uvin E} f(uv)pmod{2}$ for each $v in V$, where Z_2={0,1} is the additive group of order 2. For $iin{0,1}$, let e_f(i)=|f^{-1}(i)| and v_f(i)=|(f^+)^{-1}(i)|. A label...
Main Author: | Wai Chee Shiu |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Isfahan
2016-09-01
|
Series: | Transactions on Combinatorics |
Subjects: | |
Online Access: | http://www.combinatorics.ir/article_12473_5cd474dbde30ab0cf85638c76d56808a.pdf |
Similar Items
-
Full edge-friendly index sets of complete bipartite graphs
by: Wai Chee Shiu
Published: (2017-06-01) -
Full friendly index sets of slender and flat cylinder graphs
by: Wai Chee Shiu, et al.
Published: (2013-12-01) -
Decomposition of Certain Complete Graphs and Complete Multipartite Graphs into Almost-bipartite Graphs and Bipartite Graphs
by: G. Sethuraman, et al.
Published: (2020-07-01) -
On the Palette Index of Complete Bipartite Graphs
by: Horňák Mirko, et al.
Published: (2018-05-01) -
One-sided interval edge-colorings of bipartite graphs
by: Renman, Jonatan
Published: (2020)