Arc analysis algorithm (AAA) for arc-weighted graphs

DOI10.1142/S1793830913500262MaRDI QIDQ2874037zbMATH OpenOpenAlexFDO

Authors Sunil Mathew

Publication date 28 January 2014

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s1793830913500262

zbMATH Keywords

partial treestrength of connectednessstrong arc

Mathematics Subject Classification ID

Trees (05C05) Signed and weighted graphs (05C22) Paths and cycles (05C38) Connectivity (05C40)

Recommendations

• Some connectivity concepts in weighted graphs
• Special sequences in weighted graphs
• Cycle connectivity in weighted graphs
• Partial trees in weighted graphs-I
• A characterization of partial blocks in weighted graphs

Cites work

• A characterization of partial blocks in weighted graphs
• A generalization of Menger's theorem
• Cycle connectivity in weighted graphs
• Cycles in weighted graphs
• Heavy 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
• Types of arcs in a fuzzy graph

Cited in

(4)

• Special sequences in weighted graphs
• Partial trees in weighted graphs-I
• A characterization of partial blocks in weighted graphs
• Monophonic convexity in weighted graphs

This page was built for publication: Arc analysis algorithm (AAA) for arc-weighted graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2874037)