Universitat de Lleida
    • English
    • català
    • español
  • English 
    • English
    • català
    • español
  • Login
Repositori Obert UdL
View Item 
  •   Home
  • Recerca
  • Matemàtica
  • Articles publicats (Matemàtica)
  • View Item
  •   Home
  • Recerca
  • Matemàtica
  • Articles publicats (Matemàtica)
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Degree diameter problem on honeycomb networks

Thumbnail
View/Open
022219.pdf (3.883Mb)
Sol·licita una còpia
Issue date
2014-08-23
Author
Holub, Přemys
Miller, Mirka
Pérez Rosés, Hebert
Ryan, Joe
Suggested citation
Holub, Přemys; Miller, Mirka; Pérez Rosés, Hebert; Ryan, Joe; . (2014) . Degree diameter problem on honeycomb networks. Discrete Applied Mathematics, 2014, vol. 179, p. 139-151. https://doi.org/10.1016/j.dam.2014.07.012.
Impact


Web of Science logo    citations in Web of Science

Scopus logo    citations in Scopus

Google Scholar logo  Google Scholar
Share
Export to Mendeley
Metadata
Show full item record
Abstract
The degree diameter problem involves finding the largest graph (in terms of the number of vertices) subject to constraints on the degree and the diameter of the graph. Beyond the degree constraint there is no restriction on the number of edges (apart from keeping the graph simple) so the resulting graph may be thought of as being embedded in the complete graph. In a generalization of this problem, the graph is considered to be embedded in some connected host graph, in this paper the honeycomb network. We consider embedding the graph in the k-dimensional honeycomb grid and provide upper and lower bounds for the optimal graph. The particular cases of dimensions 2 and 3 are examined in detail.
URI
http://hdl.handle.net/10459.1/47998
DOI
https://doi.org/10.1016/j.dam.2014.07.012
Is part of
Discrete Applied Mathematics, 2014, vol. 179, p. 139-151
European research projects
Collections
  • Articles publicats (Matemàtica) [263]

Related items

Showing items related by title, author, creator and subject.

  • A variant of the McKay-Miller-Siran construction for Mixed Graphs 

    López Lorenzo, Ignacio; Pérez Rosés, Hebert; Pujolàs Boix, Jordi; Zdimalovà, Maria (Elsevier B.V., 2016-09-27)
    The Degree/Diameter Problem is an extremal problem in graph theory with applications in network design. One of the main research areas in the Degree/Diameter Problem consists of finding large graphs whose order approach ...
  • The Degree/Diameter Problem for Mixed Abelian Cayley Graphs 

    López Lorenzo, Ignacio; Pérez Rosés, Hebert; Pujolàs Boix, Jordi (Elsevier, 2017-11-20)
    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 ...
  • Algebraic and computer-based methods in the undirected degree=diameter problem – a brief survey 

    Pérez Rosés, Hebert (Indonesian Combinatorial Society (InaCombS)Graph Theory and Applications (GTA) Research CentreUniversity of Newcastle (Australia)Institut Teknologi Bandung (ITB) (Indonesia), 2014)
    This paper discusses the most popular algebraic techniques and computational methods that have been used to construct large undirected graphs with given degree and diameter.

Contact Us | Send Feedback | Legal Notice
© 2021 BiD. Universitat de Lleida
Metadata subjected to 
 

 

Browse

All of the repositoryCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

Statistics

View Usage Statistics

D'interès

Política institucional d'accés obertDiposita les teves publicacionsDiposita dades de recercaSuport a la recerca

Contact Us | Send Feedback | Legal Notice
© 2021 BiD. Universitat de Lleida
Metadata subjected to