Upper Bounds of the Generalized Competition Indices of Symmetric Primitive Digraphs with <i>d</i> Loops
A digraph (<i>D</i>) is symmetric if <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mo>(</mo><mi>u</mi><mo>,</mo><mi>v</mi><mo>)</mo&g...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2023-07-01
|
| Series: | Symmetry |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2073-8994/15/7/1348 |