Path 3-(edge-)connectivity of lexicographic product graphs
- 1 August 2020
- journal article
- research article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 282, 152-161
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China
- Natural Science Foundation of Qinghai Province
This publication has 17 references indexed in Scilit:
- Path-connectivity of lexicographic product graphsInternational Journal of Computer Mathematics, 2014
- Sharp bounds for the generalized connectivityDiscrete Mathematics, 2010
- Constructing edge-disjoint spanning trees in product networksIEEE Transactions on Parallel and Distributed Systems, 2003
- Edge-disjoint spanning trees on the star network with applications to fault toleranceIEEE Transactions on Computers, 1996
- Hardware-assisted software clock synchronization for homogeneous distributed systemsIEEE Transactions on Computers, 1990
- A survey of gossiping and broadcasting in communication networksNetworks, 1988
- Path-connectivity in graphsDiscrete Mathematics, 1986
- Pendant tree-connectivityJournal of Combinatorial Theory, Series B, 1985
- In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre UnterteilungenMathematische Nachrichten, 1960
- Congruent Graphs and the Connectivity of GraphsAmerican Journal of Mathematics, 1932