k-Components, Clusters and Slicings in Graphs
From MaRDI portal
Publication:5654067
DOI10.1137/0122040zbMath0243.05111OpenAlexW2054145937MaRDI QIDQ5654067
Publication date: 1972
Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0122040
Factor analysis and principal components; correspondence analysis (62H25) Deterministic network models in operations research (90B10) Graph theory (05C99)
Related Items
On the lower bound of \(k\)-maximal digraphs ⋮ Minimum degree orderings ⋮ Large survivable nets and the generalized prisms ⋮ On the sizes of \(k\)-edge-maximal \(r\)-uniform hypergraphs ⋮ Analysis of social networks and Wi-Fi networks by using the concept of picture fuzzy graphs ⋮ Unnamed Item ⋮ Clusteranalyse - Überblick und neuere Entwicklungen ⋮ Onk-Maximal Strength Digraphs ⋮ On the extremal sizes of maximal graphs without \(( k + 1 )\)-connected subgraphs ⋮ ON THE DICHROMATIC INDEX OF A DIGRAPH ⋮ Covering complete hypergraphs with cuts of minimum total size ⋮ Unnamed Item ⋮ Characterizations of strength extremal graphs ⋮ Coloring temporal graphs ⋮ The connectivity of generalized graph products ⋮ Some applications of graph theory to clustering ⋮ Data analysis implications of some concepts related to the cuts of a graph ⋮ A set-theoretical approach to the problem of hierarchical clustering ⋮ How many circuits determine an oriented matroid? ⋮ Covering Complete r-Graphs with Spanning Complete r-Partite r-Graphs ⋮ k-Blocks and Ultrablocks in Graphs ⋮ Validity of clusters formed by graph-theoretic cluster methods ⋮ On the sizes of bi-\(k\)-maximal graphs ⋮ On fractional cut covers ⋮ A graph b-coloring framework for data clustering ⋮ On the sizes of vertex-\(k\)-maximal \(r\)-uniform hypergraphs ⋮ An edge extremal result for subcohesion ⋮ On the sizes of \((k, l)\)-edge-maximal \(r\)-uniform hypergraphs ⋮ A clustering algorithm based on graph connectivity ⋮ The extremal sizes of arc-maximal \((k, \ell)\)-digraphs ⋮ \((p,k)\)-coloring problems in line graphs
