A characterization of partial blocks in weighted graphs
From MaRDI portal
Publication:456097
DOI10.1016/J.IPL.2012.06.015zbMATH Open1248.05100OpenAlexW2073941863MaRDI QIDQ456097FDOQ456097
Authors: 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
Recommendations
interconnection networksweighted graphpartial blockpartial cut vertexstrong cyclestrongest strong cycle
Cites Work
- Title not available (Why is that?)
- Some Theorems on Abstract Graphs
- Types of arcs in a fuzzy graph
- Heavy paths and cycles in weighted graphs
- Heavy cycles in weighted graphs
- Cycle connectivity in weighted graphs
- Node connectivity and arc connectivity of a fuzzy graph
- Cycles in weighted graphs
- Partial trees in weighted graphs-I
- Bonds in graphs and fuzzy graphs
- Some connectivity concepts in weighted graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- A generalization of Menger's theorem
Cited In (7)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A linear time algorithm for the nullity of vertex-weighted block graphs
- Some connectivity concepts in weighted graphs
- Arc analysis algorithm (AAA) for arc-weighted graphs
This page was built for publication: A characterization of partial blocks in weighted graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q456097)