The Degree/Diameter Problem for mixed abelian Cayley graphs

This paper investigates the upper bounds for the number of vertices in mixed abelian Cayley graphs with given degree and diameter. Additionally, in the case when the undirected degree is equal to one, we give a construction that provides a lower bound.

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Discrete Applied Mathematics 2017-11, Vol.231, p.190-197
Hauptverfasser:	López, Nacho, Pérez-Rosés, Hebert, Pujolàs, Jordi
Format:	Artikel
Sprache:	eng
Schlagworte:	Abelian Cayley graphs Applied mathematics Degree/Diameter Problem Graphs Network design Upper bounds
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

container_end_page	197
container_issue
container_start_page	190
container_title	Discrete Applied Mathematics
container_volume	231
creator	López, Nacho Pérez-Rosés, Hebert Pujolàs, Jordi
description	This paper investigates the upper bounds for the number of vertices in mixed abelian Cayley graphs with given degree and diameter. Additionally, in the case when the undirected degree is equal to one, we give a construction that provides a lower bound.
doi_str_mv	10.1016/j.dam.2017.04.018
format	Article
fullrecord	<record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_1966075072</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0166218X17301841</els_id><sourcerecordid>1966075072</sourcerecordid><originalsourceid>FETCH-LOGICAL-c368t-8b1228f15263f510f3ae6fb8f9a76d95749ea21f1c2823deee0283b12d039823</originalsourceid><addsrcrecordid>eNp9kE1PwzAMhiMEEmPwA7hV4tzOTtck1U5o40uaBIcduEVp62yp1nUkHWL_nkzjzMmy9T629TB2j5AhoJi0WWO6jAPKDKYZoLpgI1SSp0JKvGSjmBEpR_V5zW5CaAEAYzdis9WGkgWtPdFk4UxHA_nkw_fVlrrE9j7p3A81ialo68wumZvjlo7J2pv9JtyyK2u2ge7-6pitnp9W89d0-f7yNn9cpnUu1JCqCjlXFgsuclsg2NyQsJWypZGiKQs5LclwtFhzxfOGiICrPEIN5GWcjNnDee3e918HCoNu-4PfxYsaSyFAFiBPKTynat-H4MnqvXed8UeNoE-KdKujIn1SpGGqo6LIzM4Mxe-_HXkdake7mhrnqR5007t_6F-2PGyg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1966075072</pqid></control><display><type>article</type><title>The Degree/Diameter Problem for mixed abelian Cayley graphs</title><source>Elsevier ScienceDirect Journals Complete</source><source>EZB-FREE-00999 freely available EZB journals</source><creator>López, Nacho ; Pérez-Rosés, Hebert ; Pujolàs, Jordi</creator><creatorcontrib>López, Nacho ; Pérez-Rosés, Hebert ; Pujolàs, Jordi</creatorcontrib><description>This paper investigates the upper bounds for the number of vertices in mixed abelian Cayley graphs with given degree and diameter. Additionally, in the case when the undirected degree is equal to one, we give a construction that provides a lower bound.</description><identifier>ISSN: 0166-218X</identifier><identifier>EISSN: 1872-6771</identifier><identifier>DOI: 10.1016/j.dam.2017.04.018</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>Abelian Cayley graphs ; Applied mathematics ; Degree/Diameter Problem ; Graphs ; Network design ; Upper bounds</subject><ispartof>Discrete Applied Mathematics, 2017-11, Vol.231, p.190-197</ispartof><rights>2017 Elsevier B.V.</rights><rights>Copyright Elsevier BV Nov 20, 2017</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c368t-8b1228f15263f510f3ae6fb8f9a76d95749ea21f1c2823deee0283b12d039823</citedby><cites>FETCH-LOGICAL-c368t-8b1228f15263f510f3ae6fb8f9a76d95749ea21f1c2823deee0283b12d039823</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/j.dam.2017.04.018$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,780,784,3550,27924,27925,45995</link.rule.ids></links><search><creatorcontrib>López, Nacho</creatorcontrib><creatorcontrib>Pérez-Rosés, Hebert</creatorcontrib><creatorcontrib>Pujolàs, Jordi</creatorcontrib><title>The Degree/Diameter Problem for mixed abelian Cayley graphs</title><title>Discrete Applied Mathematics</title><description>This paper investigates the upper bounds for the number of vertices in mixed abelian Cayley graphs with given degree and diameter. Additionally, in the case when the undirected degree is equal to one, we give a construction that provides a lower bound.</description><subject>Abelian Cayley graphs</subject><subject>Applied mathematics</subject><subject>Degree/Diameter Problem</subject><subject>Graphs</subject><subject>Network design</subject><subject>Upper bounds</subject><issn>0166-218X</issn><issn>1872-6771</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2017</creationdate><recordtype>article</recordtype><recordid>eNp9kE1PwzAMhiMEEmPwA7hV4tzOTtck1U5o40uaBIcduEVp62yp1nUkHWL_nkzjzMmy9T629TB2j5AhoJi0WWO6jAPKDKYZoLpgI1SSp0JKvGSjmBEpR_V5zW5CaAEAYzdis9WGkgWtPdFk4UxHA_nkw_fVlrrE9j7p3A81ialo68wumZvjlo7J2pv9JtyyK2u2ge7-6pitnp9W89d0-f7yNn9cpnUu1JCqCjlXFgsuclsg2NyQsJWypZGiKQs5LclwtFhzxfOGiICrPEIN5GWcjNnDee3e918HCoNu-4PfxYsaSyFAFiBPKTynat-H4MnqvXed8UeNoE-KdKujIn1SpGGqo6LIzM4Mxe-_HXkdake7mhrnqR5007t_6F-2PGyg</recordid><startdate>20171120</startdate><enddate>20171120</enddate><creator>López, Nacho</creator><creator>Pérez-Rosés, Hebert</creator><creator>Pujolàs, Jordi</creator><general>Elsevier B.V</general><general>Elsevier BV</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20171120</creationdate><title>The Degree/Diameter Problem for mixed abelian Cayley graphs</title><author>López, Nacho ; Pérez-Rosés, Hebert ; Pujolàs, Jordi</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c368t-8b1228f15263f510f3ae6fb8f9a76d95749ea21f1c2823deee0283b12d039823</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2017</creationdate><topic>Abelian Cayley graphs</topic><topic>Applied mathematics</topic><topic>Degree/Diameter Problem</topic><topic>Graphs</topic><topic>Network design</topic><topic>Upper bounds</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>López, Nacho</creatorcontrib><creatorcontrib>Pérez-Rosés, Hebert</creatorcontrib><creatorcontrib>Pujolàs, Jordi</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Discrete Applied Mathematics</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>López, Nacho</au><au>Pérez-Rosés, Hebert</au><au>Pujolàs, Jordi</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>The Degree/Diameter Problem for mixed abelian Cayley graphs</atitle><jtitle>Discrete Applied Mathematics</jtitle><date>2017-11-20</date><risdate>2017</risdate><volume>231</volume><spage>190</spage><epage>197</epage><pages>190-197</pages><issn>0166-218X</issn><eissn>1872-6771</eissn><abstract>This paper investigates the upper bounds for the number of vertices in mixed abelian Cayley graphs with given degree and diameter. Additionally, in the case when the undirected degree is equal to one, we give a construction that provides a lower bound.</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/j.dam.2017.04.018</doi><tpages>8</tpages><oa>free_for_read</oa></addata></record>
fulltext	fulltext
identifier	ISSN: 0166-218X
ispartof	Discrete Applied Mathematics, 2017-11, Vol.231, p.190-197
issn	0166-218X 1872-6771
language	eng
recordid	cdi_proquest_journals_1966075072
source	Elsevier ScienceDirect Journals Complete; EZB-FREE-00999 freely available EZB journals
subjects	Abelian Cayley graphs Applied mathematics Degree/Diameter Problem Graphs Network design Upper bounds
title	The Degree/Diameter Problem for mixed abelian Cayley graphs
url	https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-28T12%3A51%3A06IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=The%20Degree/Diameter%20Problem%20for%20mixed%20abelian%20Cayley%20graphs&rft.jtitle=Discrete%20Applied%20Mathematics&rft.au=L%C3%B3pez,%20Nacho&rft.date=2017-11-20&rft.volume=231&rft.spage=190&rft.epage=197&rft.pages=190-197&rft.issn=0166-218X&rft.eissn=1872-6771&rft_id=info:doi/10.1016/j.dam.2017.04.018&rft_dat=%3Cproquest_cross%3E1966075072%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1966075072&rft_id=info:pmid/&rft_els_id=S0166218X17301841&rfr_iscdi=true