Extremal Results on <i>ℓ</i>-Connected Graphs or Pancyclic Graphs Based on Wiener-Type Indices
A graph of order <i>n</i> is called pancyclic if it contains a cycle of length <i>y</i> for every <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mn>3</mn><mo>≤&l...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2024-12-01
|
| Series: | Mathematics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2227-7390/13/1/10 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|