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 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 s...

Descripción completa

Detalles Bibliográficos
Autores: Ichishima, Rikio, Muntaner Batle, Francesc Antoni, Rius Font, Miquel
Tipo de recurso: informe técnico
Fecha de publicación:2009
País:España
Institución:Universitat Politècnica de Catalunya (UPC)
Repositorio:UPCommons. Portal del coneixement obert de la UPC
Idioma:inglés
OAI Identifier:oai:upcommons.upc.edu:2117/7063
Acceso en línea:https://hdl.handle.net/2117/7063
Access Level:acceso abierto
Palabra clave:Graph theory
Computer science--Mathematics
Grafs, Teoria de
Matemàtica
Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Teoria de grafs
id ES_dc383fda9d5063d2aeb6c8f5eb9ddaf2
oai_identifier_str oai:upcommons.upc.edu:2117/7063
network_acronym_str ES
network_name_str España
repository_id_str
spelling Bounds on the size of super edge-magic graphs depending on the girthIchishima, RikioMuntaner Batle, Francesc AntoniRius Font, MiquelGraph theoryComputer science--MathematicsGrafs, Teoria deMatemàticaÀrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Teoria de grafsLet 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.20092009-12-1320102010-04-22reporthttp://purl.org/coar/resource_type/c_93fcAOhttp://purl.org/coar/version/c_b1a7d7d4d402bcceinfo:eu-repo/semantics/reportapplication/pdfhttps://hdl.handle.net/2117/7063reponame:UPCommons. Portal del coneixement obert de la UPCinstname:Universitat Politècnica de Catalunya (UPC)Inglésengopen accesshttp://purl.org/coar/access_right/c_abf2Attribution-NonCommercial-NoDerivs 3.0 Spainhttp://creativecommons.org/licenses/by-nc-nd/3.0/es/info:eu-repo/semantics/openAccessoai:upcommons.upc.edu:2117/70632026-05-27T15:37:01Z
dc.title.none.fl_str_mv Bounds on the size of super edge-magic graphs depending on the girth
title Bounds on the size of super edge-magic graphs depending on the girth
spellingShingle Bounds on the size of super edge-magic graphs depending on the girth
Ichishima, Rikio
Graph theory
Computer science--Mathematics
Grafs, Teoria de
Matemàtica
Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Teoria de grafs
title_short Bounds on the size of super edge-magic graphs depending on the girth
title_full Bounds on the size of super edge-magic graphs depending on the girth
title_fullStr Bounds on the size of super edge-magic graphs depending on the girth
title_full_unstemmed Bounds on the size of super edge-magic graphs depending on the girth
title_sort Bounds on the size of super edge-magic graphs depending on the girth
dc.creator.none.fl_str_mv Ichishima, Rikio
Muntaner Batle, Francesc Antoni
Rius Font, Miquel
author Ichishima, Rikio
author_facet Ichishima, Rikio
Muntaner Batle, Francesc Antoni
Rius Font, Miquel
author_role author
author2 Muntaner Batle, Francesc Antoni
Rius Font, Miquel
author2_role author
author
dc.subject.none.fl_str_mv Graph theory
Computer science--Mathematics
Grafs, Teoria de
Matemàtica
Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Teoria de grafs
topic Graph theory
Computer science--Mathematics
Grafs, Teoria de
Matemàtica
Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Teoria de grafs
description 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.
publishDate 2009
dc.date.none.fl_str_mv 2009
2009-12-13
2010
2010-04-22
dc.type.none.fl_str_mv report
http://purl.org/coar/resource_type/c_93fc
AO
http://purl.org/coar/version/c_b1a7d7d4d402bcce
dc.type.openaire.fl_str_mv info:eu-repo/semantics/report
format report
dc.identifier.none.fl_str_mv https://hdl.handle.net/2117/7063
url https://hdl.handle.net/2117/7063
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2
Attribution-NonCommercial-NoDerivs 3.0 Spain
http://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.rights.openaire.fl_str_mv info:eu-repo/semantics/openAccess
rights_invalid_str_mv open access
http://purl.org/coar/access_right/c_abf2
Attribution-NonCommercial-NoDerivs 3.0 Spain
http://creativecommons.org/licenses/by-nc-nd/3.0/es/
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:UPCommons. Portal del coneixement obert de la UPC
instname:Universitat Politècnica de Catalunya (UPC)
instname_str Universitat Politècnica de Catalunya (UPC)
reponame_str UPCommons. Portal del coneixement obert de la UPC
collection UPCommons. Portal del coneixement obert de la UPC
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869421748267515904
score 15,300719

Similares en LA Referencia