Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Magic_graph> ?p ?o. }
Showing items 1 to 11 of
11
with 100 items per page.
- Magic_graph abstract "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, independent of the choice of vertex; or it is a graph that has such a labelling. If the integers are the first q positive integers, where q is the number of edges, the graph and the labelling are called supermagic.A graph is vertex-magic if its vertices can be labelled so that the sum on any edge is the same. It is total magic if its edges and vertices can be labelled so that the vertex label plus the sum of labels on edges incident with that vertex is a constant. There are a great many variations on the concept of magic labelling of a graph. There is much variation in terminology as well. The definitions here are perhaps the most common.Comprehensive references for magic labellings and magic graphs are Gallian (1998), Wallis (2001), and Marr and Wallis (2013).".
- Magic_graph wikiPageID "4351071".
- Magic_graph wikiPageRevisionID "554867390".
- Magic_graph subject Category:Graphs.
- Magic_graph comment "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, independent of the choice of vertex; or it is a graph that has such a labelling. If the integers are the first q positive integers, where q is the number of edges, the graph and the labelling are called supermagic.A graph is vertex-magic if its vertices can be labelled so that the sum on any edge is the same.".
- Magic_graph label "Magic graph".
- Magic_graph sameAs m.0swlgpf.
- Magic_graph sameAs Q17125113.
- Magic_graph sameAs Q17125113.
- Magic_graph wasDerivedFrom Magic_graph?oldid=554867390.
- Magic_graph isPrimaryTopicOf Magic_graph.