On the edge-balanced index sets of product graphs

MaRDI QIDQ5403277zbMATH OpenFDO

Authors Elliot Krop, Sin-Min Lee, Christopher Raridan

Publication date 25 March 2014

Full work available at URL https://arxiv.org/abs/1103.4994

zbMATH Keywords

friendly index setcordialityfriendly labelingedge labelingedge-friendly labelingpartial-coloring

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Abstract: We characterize strongly edge regular product graphs and find the edge-balanced index sets of complete bipartite graphs without a perfect matching, the direct product $K_{n}imes{K}_2$. We also prove a lemma that is helpful to determine the edge-balanced index sets of regular graphs.

This page was built for publication: On the edge-balanced index sets of product graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5403277)