Bounds on the size of super edge-magic graphs depending on the girth

All of RECERCAT

To access the full text documents, please follow this link: http://hdl.handle.net/2117/7063

Title:	Bounds on the size of super edge-magic graphs depending on the girth
Author:	Ichishima, Rikio; Muntaner Batle, Francesc Antoni; Rius Font, Miquel
Other authors:	Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada IV; Universitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions
Abstract:	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 is super edge-magic and q = 2p−3, then the girth of G is 3. It is also known that if the girth of G is at least 4 and G is super edge-magic then q 2p − 5. In this paper we show that there are infinitely many graphs which are super edge-magic, have girth 5, and q = 2p−5. Therefore the maximum size for super edge-magic graphs of girth 5 cannot be reduced with respect to the maximum size of super edge-magic graphs of girth 4.
Subject(s):	-Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Teoria de grafs -Graph theory -Computer science--Mathematics -Grafs, Teoria de -Matemàtica
Rights:	Attribution-NonCommercial-NoDerivs 3.0 Spain http://creativecommons.org/licenses/by-nc-nd/3.0/es/
Document type:	Article - Draft Report
Share: