Lupa

Show document Help

A- | A+ | Print
Title:On bipartite (1,1,k)-mixed graphs
Authors:ID Dalfó, Cristina (Author)
ID Erskine, Grahame (Author)
ID Exoo, Geoffrey (Author)
ID Àngel Fiol, Miquel (Author)
ID Tuite, James (Author)
Files:.pdf ADAM_Dalfó,Erskine,Exoo,Àngel_Fiol,Tuite_2025.pdf (628,98 KB)
MD5: 19EE9C7C672AE26FAE03D5DF7A4B7017
 
Language:English
Work type:Article
Typology:1.01 - Original Scientific Article
Organization:ZUP - University of Primorska Press
Abstract: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 and in which the undirected and directed degrees are one. The best graphs, in terms of the number of vertices, are presented for small diameters. Moreover, two infinite families of such graphs with diameter k and number of vertices of the order of 2k/2 are proposed, one of them being totally regular (1,1)-mixed graphs. In addition, we present two more infinite families called chordal ring and chordal double ring mixed graphs, which are bipartite and related to tessellations of the plane. Finally, we give an upper bound that improves the Moore bound for bipartite mixed graphs for r = z = 1.
Keywords:mixed graph, degree/diameter problem, Moore bound, bipartite graph
Publication status:Published
Publication version:Version of Record
Publication date:16.06.2025
Publisher:Založba Univerze na Primorskem
Year of publishing:2025
Number of pages:24 str.
Numbering:Vol. 8, no. 3, [article no.] P3.08
PID:20.500.12556/RUP-22080 This link opens in a new window
UDC:519.17
eISSN:2590-9770
DOI:10.26493/2590-9770.1728.3f1 This link opens in a new window
Publication date in RUP:03.11.2025
Views:87
Downloads:0
Metadata:XML DC-XML DC-RDF
:
Copy citation
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and Share


Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Record is a part of a journal

Title:The Art of Discrete and Applied Mathematics
Publisher:Založba Univerze na Primorskem
ISSN:2590-9770

Document is financed by a project

Funder:AGAUR Catalan Government
Project number:2021SGR00434

Funder:MICINN Spanish Government
Project number:PID2020-115442RB-I00

Funder:Universitat Politècnica de Catalunya
Project number:AGRUPS-2022

Funder:Universitat Politècnica de Catalunya
Project number:AGRUPS-2023

Licences

License:CC BY 4.0, Creative Commons Attribution 4.0 International
Link:http://creativecommons.org/licenses/by/4.0/
Description:This is the standard Creative Commons license that gives others maximum freedom to do what they want with the work as long as they credit the author.

Secondary language

Language:Slovenian
Title:Dvodelni (1,1, k)-mešani grafi
Keywords:mešani graf, problem stopnje in premera, Moorova meja, dvodelni graf


Comments

Leave comment

You must log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica