Antimagic Properties of Graphs with Large Maximum Degree

Autor:	Zelealem B. Yilma
Rok vydání:	2012
Předmět:	Discrete mathematics Combinatorics Mathematics::Combinatorics Degree (graph theory) Bijection Discrete Mathematics and Combinatorics Geometry and Topology Graph property Graph Vertex (geometry) Mathematics
Zdroj:	Journal of Graph Theory. 72:367-373
ISSN:	0364-9024
DOI:	10.1002/jgt.21664
Popis:	An antimagic labeling of a graph with m edges and n vertices is a bijection from the set of edges to the integers such that all n vertex sums are pairwise distinct, where a vertex sum is the sum of labels of all edges incident with the same vertex. A graph is called antimagic if it has an antimagic labeling. In this article, we discuss antimagic properties of graphs that contain vertices of large degree. We also show that graphs with maximum degree at least are antimagic.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::ae87e7fc94d677793fc833fb6a362012 https://doi.org/10.1002/jgt.21664 Zobrazit plný text záznamu Plný text