A graph‐theoretic definition of a sociometric clique†
From MaRDI portal
Publication:4051973
DOI10.1080/0022250X.1973.9989826zbMath0297.92019WikidataQ56335590 ScholiaQ56335590MaRDI QIDQ4051973
Publication date: 1973
Published in: The Journal of Mathematical Sociology (Search for Journal in Brave)
62P25: Applications of statistics to social sciences
05C99: Graph theory
91D99: Mathematical sociology (including anthropology)
Related Items
The emergence of groups in the evolution of friendship networks, Integer models and upper bounds for the 3‐club problem, Finding clubs in graph classes, On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs, Games of social interactions with local and global externalities, Upper bounds and heuristics for the 2-club problem, A branch-and-bound approach for maximum quasi-cliques, LS sets as cohesive subsets of graphs and hypergraphs, The cohesiveness of subgroups in social networks: A view from game theory, Structural consequences of individual position in nondyadic social networks, Structures induced by collections of subsets: A hypergraph approach, Combined stress and human performance: A weighted digraph model, Nonmetric grouping: clusters and cliques, An exact algorithm for the maximum \(k\)-club problem in an undirected graph, Heuristics for finding \(k\)-clubs in an undirected graph, Approximation and tidying -- a problem kernel for \(s\)-plex cluster vertex deletion, Novel approaches for analyzing biological networks, On fuzzy cliques in fuzzy networks, Graph theoretic blockings k‐plexes and k‐cutpoints, Clustering representations of group overlap†, A graph‐theoretic generalization of the clique concept
Cites Work
