k-Components, Clusters and Slicings in Graphs

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

Cited In (31)

On the sizes of \((k, l)\)-edge-maximal \(r\)-uniform hypergraphs
ON THE DICHROMATIC INDEX OF A DIGRAPH
On the sizes of \(k\)-edge-maximal \(r\)-uniform hypergraphs
The extremal sizes of arc-maximal \((k, \ell)\)-digraphs
Minimum degree orderings
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
Title not available (Why is that?)
Analysis of social networks and Wi-Fi networks by using the concept of picture fuzzy graphs
On the extremal sizes of maximal graphs without \(( k + 1 )\)-connected subgraphs
Covering Complete r-Graphs with Spanning Complete r-Partite r-Graphs
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
An edge extremal result for subcohesion
Title not available (Why is that?)
Covering complete hypergraphs with cuts of minimum total size
On the sizes of bi-\(k\)-maximal graphs
Onk-Maximal Strength Digraphs
\((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)