Back to Search
Start Over
Full friendly index set — I.
- Source :
-
Discrete Applied Mathematics . Jun2013, Vol. 161 Issue 9, p1262-1274. 13p. - Publication Year :
- 2013
-
Abstract
- Abstract: Let be a graph, a vertex labeling induces an edge labeling defined by for each . For each, define and . We call friendly if . The full friendly index set of is the set of all possible values of , where is friendly. In this paper, we study the full friendly index sets of some standard graphs such as the complete graph , the cycle , fans and and the Cartesian product of and i.e. . [Copyright &y& Elsevier]
Details
- Language :
- English
- ISSN :
- 0166218X
- Volume :
- 161
- Issue :
- 9
- Database :
- Academic Search Index
- Journal :
- Discrete Applied Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 89478286
- Full Text :
- https://doi.org/10.1016/j.dam.2012.10.028