On multigraphic and potentially multigraphic sequences
An r-graph(or a multigraph) is a loopless graph in which no two vertices are joined by more than r edges. An r-complete graph on n vertices, denoted by Kn(r) , is an r-graph on n vertices in which each pair of vertices is joined by exactly r edges. A non-increasing sequence π = (d1, d2, ..., dn) of...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Scientia Publishing House
2017-07-01
|
| Series: | Acta Universitatis Sapientiae: Informatica |
| Subjects: | |
| Online Access: | https://doi.org/10.1515/ausi-2017-0003 |