G (A, B)-labeling of cacti over groups
Abstract
© 2016 Author(s). Let G be a group with nonempty subsets A and B. The graph G(A, B) is the simple graph obtained by deleting all loops from the graph whose vertex set is A and where vertices x and y are adjacent if and only if there is a b B such that xb = y or yb = x. In this paper, we present realizations of some cacti as G(A, B)'s.
Source or Periodical Title
AIP Conference Proceedings
ISSN
0094243X
Document Type
Article
Recommended Citation
Egarguin, Neil Jerome A. and Panopio, Rolando G., "G (A, B)-labeling of cacti over groups" (2021). Journal Article. 1584.
https://www.ukdr.uplb.edu.ph/journal-articles/1584
COinS