Self-converse mixed graphs are extremely rare (Q2144585): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q5422499 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Which graphs are determined by their spectrum? / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Enumeration of self‐converse digraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Number of Linear, Directed, Rooted, and Connected Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5682013 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The negative tetrahedron and the first infinite family of connected digraphs that are strongly determined by the Hermitian spectrum / rank | |||
Normal rank |
Latest revision as of 08:38, 29 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Self-converse mixed graphs are extremely rare |
scientific article |
Statements
Self-converse mixed graphs are extremely rare (English)
0 references
14 June 2022
0 references
mixed graph
0 references
digraph
0 references
self-converse
0 references