Back to Search
Start Over
A class of antimagic join graphs.
- Source :
-
Acta Mathematica Sinica . May2013, Vol. 29 Issue 5, p1019-1026. 8p. - Publication Year :
- 2013
-
Abstract
- A labeling f of a graph G is a bijection from its edge set E( G) to the set {1, 2, ..., | E( G)|}, which is antimagic if for any distinct vertices x and y, the sum of the labels on edges incident to x is different from the sum of the labels on edges incident to y. A graph G is antimagic if G has an f which is antimagic. Hartsfield and Ringel conjectured in 1990 that every connected graph other than K2 is antimagic. In this paper, we show that if G is an n-vertex graph with minimum degree at least r, and G2 is an m-vertex graph with maximum degree at most 2 r − 1 ( m ≥ n), then G ∀ G is antimagic. [ABSTRACT FROM AUTHOR]
- Subjects :
- *GRAPH labelings
*BIJECTIONS
*GRAPH connectivity
*SET theory
*MATHEMATICS
Subjects
Details
- Language :
- English
- ISSN :
- 14398516
- Volume :
- 29
- Issue :
- 5
- Database :
- Academic Search Index
- Journal :
- Acta Mathematica Sinica
- Publication Type :
- Academic Journal
- Accession number :
- 86865468
- Full Text :
- https://doi.org/10.1007/s10114-012-1559-0