On the Maximal Shortest Paths Cover Number
A shortest path <i>P</i> of a graph <i>G</i> is maximal if <i>P</i> is not contained as a subpath in any other shortest path. A set <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics>&...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2021-07-01
|
| Series: | Mathematics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2227-7390/9/14/1592 |