Cyclic Structure, Vertex Degree and Number of Linear Vertices in Minimal Strong Digraphs
Minimal Strong Digraphs (MSDs) can be regarded as a generalization of the concept of tree to directed graphs. Their cyclic structure and some spectral properties have been studied in several articles. In this work, we further study some properties of MSDs that have to do with bounding the length of...
Saved in:
Main Authors: | Miguel Arcos-Argudo, Jesús Lacalle, Luis M. Pozo-Coronado |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2024-11-01
|
Series: | Mathematics |
Subjects: | |
Online Access: | https://www.mdpi.com/2227-7390/12/23/3657 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A proof of some Schützenberger-type results for Eulerian paths and circuits on digraphs
by: Byoung-Song Chwe
Published: (1994-01-01) -
On relationship between reformulated Sombor and other vertex--degree indices
by: Emina Milovanovic, et al.
Published: (2024-09-01) -
A note on the vertex-switching reconstruction
by: I. Krasikov
Published: (1988-01-01) -
Existence of acyclic matching and Morse complex on transitive digraphs
by: Chong Wang, et al.
Published: (2025-01-01) -
Phonological Errors Produced By Students In Pronouncing English Silent Letters
by: Rumbardi Rumbardi, et al.
Published: (2022-10-01)