A graph‐theoretic definition of a sociometric clique†

DOI10.1080/0022250X.1973.9989826zbMath0297.92019OpenAlexW1987173300WikidataQ56335590 ScholiaQ56335590MaRDI QIDQ4051973

Publication date: 1973

Published in: The Journal of Mathematical Sociology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/0022250x.1973.9989826

Mathematics Subject Classification ID

Applications of statistics to social sciences (62P25) Graph theory (05C99) Mathematical sociology (including anthropology) (91D99)

Related Items (64)

Structural cohesion and embeddedness in two-mode networks ⋮ The triangle \(k\)-club problem ⋮ Graph theoretic blockings k‐plexes and k‐cutpoints ⋮ Finding a maximum \(k\)-club using the \(k\)-clique formulation and canonical hypercube cuts ⋮ Optimal approximation algorithms for maximum distance-bounded subgraph problems ⋮ Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights ⋮ Finding disjoint dense clubs in a social network ⋮ On Fault-Tolerant Low-Diameter Clusters in Graphs ⋮ Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems ⋮ A graph-based active learning method for classification of remote sensing images ⋮ Integer models and upper bounds for the 3‐club problem ⋮ Formalising and detecting community structures in real world complex networks ⋮ Complex networks: structure and dynamics ⋮ Approximating maximum diameter-bounded subgraph in unit disk graphs ⋮ Subexponential algorithm for \(d\)-cluster edge deletion: exception or rule? ⋮ \(s\)-club cluster vertex deletion on interval and well-partitioned chordal graphs ⋮ A diffusion model for churn prediction based on sociometric theory ⋮ Finding clubs in graph classes ⋮ Genetic Underpinnings of Brain Structural Connectome for Young Adults ⋮ On maximum ratio clique relaxations ⋮ On the tractability of finding disjoint clubs in a network ⋮ \(s\)-club cluster vertex deletion on interval and well-partitioned chordal graphs ⋮ On the 2-Club Polytope of Graphs ⋮ Algorithms for 2-club cluster deletion problems using automated generation of branching rules ⋮ On the parameterized complexity of s-club cluster deletion problems ⋮ On the parameterized complexity of \(s\)-club cluster deletion problems ⋮ Approximation and tidying -- a problem kernel for \(s\)-plex cluster vertex deletion ⋮ On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs ⋮ Structures induced by collections of subsets: A hypergraph approach ⋮ Covering a Graph with Clubs ⋮ Combined stress and human performance: A weighted digraph model ⋮ Finding overlapping communities in networks by label propagation ⋮ The cohesiveness of subgroups in social networks: A view from game theory ⋮ The emergence of groups in the evolution of friendship networks ⋮ Parsimonious formulations for low-diameter clusters ⋮ Finding Disjoint Dense Clubs in an Undirected Graph ⋮ Dense Subgraphs in Biological Networks ⋮ Finding large \(k\)-clubs in undirected graphs ⋮ Multivariate algorithmics for finding cohesive subnetworks ⋮ Heuristics for finding \(k\)-clubs in an undirected graph ⋮ On detecting maximal quasi antagonistic communities in signed graphs ⋮ On fuzzy cliques in fuzzy networks ⋮ Graph signatures: identification and optimization ⋮ Data-driven RANS closures for three-dimensional flows around bluff bodies ⋮ Clustering representations of group overlap† ⋮ Games of social interactions with local and global externalities ⋮ An analytical comparison of the LP relaxations of integer models for the \(k\)-club problem ⋮ Upper bounds and heuristics for the 2-club problem ⋮ The maximum \(l\)-triangle \(k\)-club problem: complexity, properties, and algorithms ⋮ Top-\(k\) overlapping densest subgraphs: approximation algorithms and computational complexity ⋮ Nonmetric grouping: clusters and cliques ⋮ Hardness and tractability of the \(\gamma\)\textsf{-Complete Subgraph} problem ⋮ A graph‐theoretic generalization of the clique concept ⋮ A branch-and-bound approach for maximum quasi-cliques ⋮ An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph ⋮ On the tractability of covering a graph with 2-clubs ⋮ Distance-Based Clique Relaxations in Networks: s-Clique and s-Club ⋮ Data-driven RANS closures for wind turbine wakes under neutral conditions ⋮ Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs ⋮ Novel approaches for analyzing biological networks ⋮ On structural parameterizations for the 2-club problem ⋮ LS sets as cohesive subsets of graphs and hypergraphs ⋮ An exact algorithm for the maximum \(k\)-club problem in an undirected graph ⋮ Structural consequences of individual position in nondyadic social networks

Cites Work

This page was built for publication: A graph‐theoretic definition of a sociometric clique†