On the minimum hybrid rank of a graph relative to a partition of its edges and its application to electrical network analysis

DOI10.1002/cta.4490180305zbMath0699.05030OpenAlexW2171936957MaRDI QIDQ3476831

H. Narayanan

Publication date: 1990

Published in: International Journal of Circuit Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/cta.4490180305

zbMATH Keywords

edge partition

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Applications of graph theory to circuits and networks (94C15)

Related Items

Approximation algorithms for Min-k-overlap problems using the principal lattice of partitions approach, The principal lattice of partitions of a submodular function, On the notion of generalized minor in topological network theory and matroids

Cites Work

• Unnamed Item
• Lectures on matroids