A characterization of partial blocks in weighted graphs

DOI10.1016/j.ipl.2012.06.015zbMath1248.05100OpenAlexW2073941863MaRDI QIDQ456097

Sunil Mathew, M. S. Sunitha

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

zbMATH Keywords

weighted graphinterconnection networkspartial blockpartial cut vertexstrong cyclestrongest strong cycle

Mathematics Subject Classification ID

Connectivity (05C40) Signed and weighted graphs (05C22)

Related Items

Unnamed Item, ARC ANALYSIS ALGORITHM (AAA) FOR ARC-WEIGHTED GRAPHS

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