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.

An improved upper bound for the order of mixed graphs

Thumbnail
View/Open
Preprint (377.0Kb)
Issue date
2018
Author
Dalfó, Cristina
Fiol, Miguel Angel
López Lorenzo, Ignacio
Suggested citation
Dalfó, Cristina; Fiol, Miguel Angel; López Lorenzo, Ignacio; . (2018) . An improved upper bound for the order of mixed graphs. Discrete mathematics, october 2018, vol. 341, núm. 10, p. 2872-2877. https://doi.org/10.1016/j.disc.2018.06.016.
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
A mixed graph G can contain both (undirected) edges and arcs (directed edges). Here we derive an improved Moore-like bound for the maximum number of vertices of a mixed graph with diameter at least three. Moreover, a complete enumeration of all optimal (1; 1)-regular mixed graphs with diameter three is presented, so proving that, in general, the proposed bound cannot be improved.
URI
http://hdl.handle.net/10459.1/64930
DOI
https://doi.org/10.1016/j.disc.2018.06.016
Is part of
Discrete mathematics, october 2018, vol. 341, núm. 10, p. 2872-2877
European research projects
Collections
  • Publicacions de projectes finançats per la Unió Europea [534]
  • Articles publicats (Matemàtica) [263]

Related items

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

  • An improved Moore bound and some new optimal families of mixed Abelian Cayley graphs 

    Dalfó, Cristina; Fiol, Miguel Angel; López Lorenzo, Ignacio; Ryan, Joe (Elsevier, 2020)
    We consider the case in which mixed graphs (with both directed and undirected edges) are Cayley graphs of Abelian groups. In this case, some Moore bounds were derived for the maximum number of vertices that such graphs can ...
  • Sequence Mixed Graphs 

    Dalfó, Cristina; Fiol, Miguel Angel; López Lorenzo, Ignacio (Elsevier, 2017)
    A mixed graph can be seen as a type of digraph containing some edges (or two opposite arcs). Here we introduce the concept of sequence mixed graphs, which is a generalization of both sequence graphs and iterated line ...
  • A Moore-like bound for mixed abelian Cayley graphs 

    López Lorenzo, Ignacio; Pérez Rosés, Hebert; Pujolàs Boix, Jordi (Elsevier B.V., 2016-09-26)
    We give an upper bound for the number of vertices in mixed abelian Cayley 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