The circular Β―ow number F c (G) of a graph G (V,E) is the minimum r P Q such that G admits a Β―ow 0 with 1 0 (e) r Γ 1, for each e P E. We determine the circular Β―ow number of some regular multigraphs. In particular, we characterize the bipartite (2t 1)-regular graphs (t ! 1). Our results imply that
β¦ LIBER β¦
Covering numbers of regular multigraphs
β Scribed by V. E. Tarakanov
- Book ID
- 105098856
- Publisher
- SP MAIK Nauka/Interperiodica
- Year
- 1989
- Tongue
- English
- Weight
- 619 KB
- Volume
- 46
- Category
- Article
- ISSN
- 0001-4346
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Circular flow numbers of regular multigr
β
Eckhard Steffen
π
Article
π
2001
π
John Wiley and Sons
π
English
β 177 KB
On the signed star domination number of
β
Zare, S.; Rahmati, F.
π
Article
π
2014
π
Springer Netherlands
π
English
β 196 KB
Factorization of regular multigraphs int
β
S. I. El-Zanati; M. J. Plantholt; S. K. Tipnis
π
Article
π
1995
π
John Wiley and Sons
π
English
β 618 KB
## Abstract A regular multigraph with maximum multiplicity __r__ and degree __rs__ cannot always be factored into __r s__βregular simple graphs. It is shown, however, that under general conditions a similar factorization can be achieved if we first allow the addition or deletion of a relatively sma
Cycle covers of cubic multigraphs
β
Brian Alspach; Cun-Quan Zhang
π
Article
π
1993
π
Elsevier Science
π
English
β 446 KB
Alspach, B. and C.-Q. Zhang, Cycle covers of cubic multigraphs, Discrete Mathematics 111 (1993) 11-17.
On the maximum matchings of regular mult
β
Takao Nishizeki
π
Article
π
1981
π
Elsevier Science
π
English
β 793 KB
Regular Multigraphs of High Degree are 1
β
Plantholt, M. J.; Tipnis, S. K.
π
Article
π
1991
π
Oxford University Press
π
English
β 177 KB