On bipartite‐mixed graphs

descriptionPublicationkeyboard_double_arrow_right Article , Preprint 24 Apr 2018Embargo end date: 01 Jan 2016 Spain English Publisher:WileyJournal:Journal of Graph Theory, volume 89, pages 386-394 (issn: 0364-9024, eissn: 1097-0118,

Copyright policy )Funded by:EC | CONNECT

Authors: Dalfó Simó, Cristina; Fiol Mora, Miquel Àngel; López Lorenzo, Nacho;

doi: 10.1002/jgt.22257 , 10.48550/arxiv.1611.01618

arXiv: 1611.01618

handle: 2117/118347 , 10459.1/65307

On bipartite‐mixed graphs

- Summary
- Subjects
- Metrics

Abstract

AbstractMixed graphs can be seen as digraphs that have both arcs and edges (or digons, that is, two opposite arcs). In this article, 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 , and that bipartite‐mixed graphs of diameter do not exist.

Country

Spain

Related Organizations

Universitat Polite`cnica de Catalunya
Spain
Barcelona Graduate School of Mathematics
Spain
Universitat Politècnica de Catalunya
Spain
University of Lleida
Spain

Keywords

Combinatorial analysis, degree/diameter problem, Moore bound, Directed graphs (digraphs), tournaments, Vertex degrees, mixed graph, Grafs, Diameter, Mixed graph, FOS: Mathematics, Mathematics - Combinatorics, diameter, Extremal problems in graph theory, Teoria de, Distance in graphs, Grafs, Teoria de, Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Teoria de grafs, Graph theory, Degree/diameter problem, Combinatorics (math.CO), 05C35, :Matemàtiques i estadística::Matemàtica discreta::Teoria de grafs [Àrees temàtiques de la UPC], Anàlisi combinatòria

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	7
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average