Cargando…
Degree sequence for k-arc strongly connected multiple digraphs
Let D be a digraph on [Formula: see text] . Then the sequence [Formula: see text] is called the degree sequence of D. For any given sequence of pairs of integers [Formula: see text] , if there exists a k-arc strongly connected digraph D such that d is the degree sequence of D, then d is realizable a...
Autores principales: | Hong, Yanmei, Liu, Qinghai |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Springer International Publishing
2017
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5656744/ https://www.ncbi.nlm.nih.gov/pubmed/29104404 http://dx.doi.org/10.1186/s13660-017-1544-3 |
Ejemplares similares
-
Digraphs
por: Bang-Jensen, Jorgen, et al.
Publicado: (2009) -
Graphs and digraphs
por: Chartrand, Gary
Publicado: (1986) -
Threshold Digraphs
por: Cloteaux, Brian, et al.
Publicado: (2014) -
Graphs and digraphs
por: Chartrand, Gary, et al.
Publicado: (2015) -
Randić energy of digraphs
por: Cruz, Roberto, et al.
Publicado: (2022)