A characterization of partial blocks in weighted graphs
From MaRDI portal
Publication:456097
DOI10.1016/j.ipl.2012.06.015zbMath1248.05100OpenAlexW2073941863MaRDI QIDQ456097
Publication date: 23 October 2012
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2012.06.015
weighted graphinterconnection networkspartial blockpartial cut vertexstrong cyclestrongest strong cycle
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A generalization of Menger's theorem
- Types of arcs in a fuzzy graph
- Cycles in weighted graphs
- Heavy paths and cycles in weighted graphs
- Node connectivity and arc connectivity of a fuzzy graph
- Partial trees in weighted graphs-I
- Cycle connectivity in weighted graphs
- Heavy cycles in weighted graphs
- Some Theorems on Abstract Graphs