k-Components, Clusters and Slicings in Graphs

DOI10.1137/0122040MaRDI QIDQ5654067zbMATH OpenOpenAlexFDO

Authors David W. Matula

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

Mathematics Subject Classification ID

Factor analysis and principal components; correspondence analysis (62H25) Deterministic network models in operations research (90B10) Graph theory (05C99)

Cited in

(33)

• Covering complete \(r\)-graphs with spanning complete \(r\)-partite \(r\)-graphs
• On the sizes of \((k, l)\)-edge-maximal \(r\)-uniform hypergraphs
• On the sizes of \(k\)-edge-maximal \(r\)-uniform hypergraphs
• ON THE DICHROMATIC INDEX OF A DIGRAPH
• The extremal sizes of arc-maximal \((k, \ell)\)-digraphs
• Minimum degree orderings
• A synthesis for uniformly 3-edge-connected graphs
• k-Blocks and Ultrablocks in Graphs
• On the lower bound of \(k\)-maximal digraphs
• Data analysis implications of some concepts related to the cuts of a graph
• How many circuits determine an oriented matroid?
• Coloring temporal graphs
• Some applications of graph theory to clustering
• Validity of clusters formed by graph-theoretic cluster methods
• The connectivity of generalized graph products
• On the sizes of vertex-k-maximal r-uniform hypergraphs
• scientific article; zbMATH DE number 3683613 (Why is no real title available?)
• Analysis of social networks and Wi-Fi networks by using the concept of picture fuzzy graphs
• On \(k\)-maximal strength digraphs
• On the extremal sizes of maximal graphs without \(( k + 1 )\)-connected subgraphs
• Large survivable nets and the generalized prisms
• A clustering algorithm based on graph connectivity
• Characterizations of strength extremal graphs
• A graph b-coloring framework for data clustering
• A set-theoretical approach to the problem of hierarchical clustering
• Spectral conditions for the maximum subgraph edge-connectivity of graphs
• An edge extremal result for subcohesion
• Covering complete hypergraphs with cuts of minimum total size
• scientific article; zbMATH DE number 1251573 (Why is no real title available?)
• On the sizes of bi-k-maximal graphs
• \((p,k)\)-coloring problems in line graphs
• Clusteranalyse - Überblick und neuere Entwicklungen
• On fractional cut covers

This page was built for publication: k-Components, Clusters and Slicings in Graphs

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