On bipartite-mixed graphs
| Autor: | Miguel Angel Fiol, Nacho López, Cristina Dalfó |
|---|---|
| Přispěvatelé: | Universitat Politècnica de Catalunya. Departament de Matemàtiques, Universitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions |
| Jazyk: | angličtina |
| Rok vydání: | 2018 |
| Předmět: |
Combinatorial analysis
Grafs Teoria de 010102 general mathematics Moore bound Mixed graph Graph theory 0102 computer and information sciences Degree diameter problem 01 natural sciences Combinatorics Diameter 010201 computation theory & mathematics Degree/diameter problem Bipartite graph Discrete Mathematics and Combinatorics Geometry and Topology 0101 mathematics Mathematics Matemàtiques i estadística::Matemàtica discreta::Teoria de grafs [Àrees temàtiques de la UPC] Anàlisi combinatòria |
| Zdroj: | Recercat. Dipósit de la Recerca de Catalunya instname Repositorio Abierto de la UdL Universitad de Lleida UPCommons. Portal del coneixement obert de la UPC Universitat Politècnica de Catalunya (UPC) |
| Popis: | This is the peer reviewed version of the following article: Dalfo, C., Fiol, M., López, N. On bipartite-mixed graphs. "Journal of graph theory", 24 Abril 2018, p. 1-9, which has been published in final form at https://onlinelibrary.wiley.com/doi/full/10.1002/jgt.22257. This article may be used for non-commercial purposes in accordance with Wiley Terms and Conditions for Self-Archiving. Mixed graphs can be seen as digraphs that have both arcs and edges (or digons, that is, two opposite arcs). In this paper, we consider the case where such graphs are bipartite. As main results, we show that in this context the Moore-like bound is attained in the case of diameter k = 3, and that bipartite mixed graphs of diameter k ≥ 4 do not exist. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|