Skip to search formSkip to main contentSkip to account menu

Magic graph

A magic graph is a graph whose edges are labelled by positive integers, so that the sum over the edges incident with any vertex is the same… 
Wikipedia (opens in a new tab)

Related topics

Related topics

2 relations
Graph (discrete mathematics)

Broader (1)

Graph theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Graphing Ecotoxicology: The MAGIC Graph for Linking Environmental Data on Chemicals
Assessing the impact of chemicals on the environment and addressing subsequent issues are two central challenges to their safe… 
2017
2017
Union of Distance Magic Graphs
Abstract A distance magic labeling of a graph G = (V,E) with |V | = n is a bijection ℓ from V to the set {1, . . . , n} such that… 
Review
2012
Review
2012
On totally magic injections
A labelling is a mapping whose domain is some set of graph elements- the set of vertices, for example, or the set of all vertices… 
2009
2009
Magic graphs
All the graphs under consideration are supposed to be without isolated vertices, multiple edges and loops. The words “cycle” and… 
2009
2009
Bounds on the size of super edge-magic graphs depending on the girth
Let G = (V,E) be a graph of order p and size q. It is known that if G is super edge-magic graph then q 2p−3. Furthermore, if G… 
2008
2008
1 On the Integer-Magic Spectra of Honeycomb Graphs
For a positive integer k, a graph G (V, E) is £k-magic if there exists a function, namely, a labeling, I : E(G) -+ £k such that… 
2004
2004
On Super Edge-magicness of Chain Graphs whose Blocks are Complete Graphs
ABSTRACT. A (p,q) graph G is total edge-magic if there exits a bijective function f: V∪ E → {1.2,...,p+q} such that for each e=(u… 
2003
2003
On Group – magic Eulerian Graphs
Let A be an abelian group. We call a graph G = (V, E) A–magic if there exists a labeling f : E(G) → A∗ such that the induced… 
2001
2001
Super-Magic Complete k-Partite Hypergraphs
Abstract. We deal with complete k-partite hypergraphs and we show that for all k≥2 and n≠2,6 its hyperedges can be labeled by… 
1997
1997
Magic powers of graphs
Necessary and suucient conditions for a graph G that its power G i , i 2, is a magic graph and one consequence are given. 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)