LS sets as cohesive subsets of graphs and hypergraphs

DOI10.1016/0165-4896(83)90048-3MaRDI QIDQ800386zbMATH OpenOpenAlexFDO

Authors Stephen B. Seidman

Publication date 1983

Published in Mathematical Social Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0165-4896(83)90048-3

zbMATH Keywords

cliquehierarchical partitionsnetwork cutsetsnetwork decomposition

Mathematics Subject Classification ID

Connectivity (05C40) Hypergraphs (05C65) Graph theory (05C99)

Review text

A class of network cutsets (LS sets) introduced by Luccio and Sami is characterized in a simple way which is used to prove that LS sets are either disjoint or nested.

Recommendations

• Realization of set functions as cut functions of graphs and hypergraphs
• A minimal cutset of the Boolean lattice with almost all members
• Algorithms for the determination of cutsets in a hypergraph
• scientific article; zbMATH DE number 1153451
• Lattices of cuts in graphs

Cites work

• A graph‐theoretic definition of a sociometric clique†
• A graph‐theoretic generalization of the clique concept
• Cutsets and partitions of hypergraphs
• Structures induced by collections of subsets: A hypergraph approach

This page was built for publication: LS sets as cohesive subsets of graphs and hypergraphs

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