An improved upper bound for the order of mixed graphs (Q1660274): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
(8 intermediate revisions by 7 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1016/j.disc.2018.06.016 / rank | |||
Property / author | |||
Property / author: Miquel Àngel Fiol / rank | |||
Property / author | |||
Property / author: Nacho López / rank | |||
Property / author | |||
Property / author: Miquel Àngel Fiol / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Nacho López / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2884881437 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1610.00116 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A revised Moore bound for mixed graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Sequence mixed graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On mixed Moore graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Cospectral digraphs from locally line digraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3848698 / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q129497598 / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1016/J.DISC.2018.06.016 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 01:36, 11 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An improved upper bound for the order of mixed graphs |
scientific article |
Statements
An improved upper bound for the order of mixed graphs (English)
0 references
15 August 2018
0 references
mixed graph
0 references
Moore bound
0 references
network design
0 references
degree/diameter problem
0 references