Skip navigation
Skip navigation
A change is coming. Click to see a sneak peek of the new Open Research Repository.

The minimum number of vertices with girth 6 and degree set D={r,m}

link to publisher version

  • Altmetric Citations

Yuansheng, Yang; Liang, Weifa

Description

A (D;g)-cage is a graph having the minimum number of vertices, with degree set D and girth g. Denote by f(D;g) the number of vertices in a (D;g)-cage. In this paper it is shown that f({r,m};6)≥2(rm-m+1) for any 2≤r

dc.contributor.authorYuansheng, Yang
dc.contributor.authorLiang, Weifa
dc.date.accessioned2015-12-13T23:08:26Z
dc.date.available2015-12-13T23:08:26Z
dc.identifier.issn0012-365X
dc.identifier.urihttp://hdl.handle.net/1885/86697
dc.description.abstractA (D;g)-cage is a graph having the minimum number of vertices, with degree set D and girth g. Denote by f(D;g) the number of vertices in a (D;g)-cage. In this paper it is shown that f({r,m};6)≥2(rm-m+1) for any 2≤r<m, and f({r,m};6)=2(rm-m+1) if eithe
dc.publisherElsevier
dc.sourceDiscrete Mathematics
dc.subjectKeywords: Functions; Mathematical models; Set theory; Symmetric graphs; Graph theory Cage; Degree set; Girth; Symmetric graph
dc.titleThe minimum number of vertices with girth 6 and degree set D={r,m}
dc.typeJournal article
local.description.notesImported from ARIES
local.description.refereedYes
local.identifier.citationvolume269
dc.date.issued2003
local.identifier.absfor080201 - Analysis of Algorithms and Complexity
local.identifier.absfor080202 - Applied Discrete Mathematics
local.identifier.ariespublicationMigratedxPub15649
local.type.statusPublished Version
local.contributor.affiliationYuansheng, Yang, Dalian University of Technology
local.contributor.affiliationLiang, Weifa, College of Engineering and Computer Science, ANU
local.bibliographicCitation.startpage249
local.bibliographicCitation.lastpage258
local.identifier.doi10.1016/S0012-365X(02)00758-6
dc.date.updated2015-12-12T08:13:45Z
local.identifier.scopusID2-s2.0-0038141204
CollectionsANU Research Publications

Download

There are no files associated with this item.
Show simple item record


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  17 November 2022/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator