ON THE EDGE-BALANCED INDEX SETS OF PRODUCT GRAPHS

Elliot Krop; Sin-Min Lee; Christopher Raridan

doi:10.22342/jims.0.0.20.71-78

Elliot Krop ⁽¹⁾ , Sin-Min Lee ⁽²⁾ , Christopher Raridan ⁽³⁾

(1) Clayton State University, United States,

(2) San Jose State University, United States,

(3) Clayton State University, United States

https://doi.org/10.22342/jims.0.0.20.71-78

Issue
Special Edition, Year 2011

Submitted
March 9, 2012

Accepted
March 9, 2012

Published
March 9, 2012

Keywords:

Edge-labeling, partial-coloring, edge-friendly labeling, friendly labeling, cordiality, friendly index set, edge-balanced index set

ABSTRACT FULL PAPER

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<sub>n</sub> X K<sub>2</sub>. We also prove a lemma that is helpful to determine theedge-balanced index sets of regular graphs.

DOI : http://dx.doi.org/10.22342/jims.0.0.20.71-78

Full text article

Generated from XML file

Authors

Elliot Krop

Clayton State University

author@jims-a.org (Primary Contact)

Sin-Min Lee

San Jose State University

Christopher Raridan

Clayton State University

Krop, E., Lee, S.-M., & Raridan, C. (2012). ON THE EDGE-BALANCED INDEX SETS OF PRODUCT GRAPHS. Journal of the Indonesian Mathematical Society, 71–78. https://doi.org/10.22342/jims.0.0.20.71-78