Xuejiao Jiang, Yuqin Zhang, "Randomly Mt-decomposable Multigraphs and M2-equipackable Multigraphs," WSEAS Transactions on Mathematics, vol. 12, pp. -, 2013, DOI:
Xuejiao Jiang, Yuqin Zhang. Randomly Mt-decomposable Multigraphs and M2-equipackable Multigraphs.
WSEAS Transactions on Mathematics. 2013;12:-.
WSEAS Transactions on Mathematics
Print ISSN: 1109-2769, E-ISSN: 2224-2880
Volume 12, 2013
Randomly Mt-decomposable Multigraphs and M2-equipackable Multigraphs
Authors: ,
Abstract: A graph G is called randomly H − decomposable if every maximal H − packing in G uses all edges in G. G is called H − equipackable if every maximal H − packing in G is also a maximum H − packing in G. M2 − decomposable graphs, randomly M2 − decomposable graphs and M2 − equipackable graphs have been characterized. The definitions could be generalized to multigraphs. And M2 − decomposable multigraphs has been characterized. In this paper, all randomly M2 − decomposable multigraphs and M2 − equipackable multigraphs are characterized, and some notes about randomly Mt − decomposable multipraphs are given.
Pages: - WSEAS Transactions on Mathematics, ISSN / E-ISSN: 1109-2769 / 2224-2880, Volume 12, 2013DOI: *As the DOI is a unique identifier, it is already available in the pdf version.
**The DOI link will be activated in the first midst of January 2026.
, Art. #
×
Citation Tools