Path 3-(edge-)connectivity of lexicographic product graphs
From MaRDI portal
Publication:2185739
DOI10.1016/j.dam.2019.11.014zbMath1442.05115OpenAlexW2991156705WikidataQ126658943 ScholiaQ126658943MaRDI QIDQ2185739
Tianlong Ma, Mingzu Zhang, Xiaodong Liang, Jinling Wang
Publication date: 5 June 2020
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2019.11.014
Paths and cycles (05C38) Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)
Related Items (1)
Cites Work
- Graphs with large generalized (edge-)connectivity
- On extremal graphs with internally disjoint Steiner trees
- The generalized 4-connectivity of hypercubes
- The generalized 3-connectivity of star graphs and bubble-sort graphs
- Sharp bounds for the generalized connectivity \(\kappa _{3}(G)\)
- Pendant tree-connectivity
- Path-connectivity in graphs
- The generalized 3-connectivity of graph products
- Constructing edge-disjoint Steiner paths in lexicographic product networks
- Identifying codes of lexicographic product of graphs
- Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs
- Path-connectivity of lexicographic product graphs
- On the generalized (edge-)connectivity of graphs
- Generalized Connectivity of Graphs
- Rainbow trees in graphs and generalized connectivity
- In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
- A survey of gossiping and broadcasting in communication networks
- Edge-disjoint spanning trees on the star network with applications to fault tolerance
- The generalized 3-connectivity of Lexicographic product graphs
- The generalized 3-connectivity of Cartesian product graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Path 3-(edge-)connectivity of lexicographic product graphs
