Results 61 to 70 of about 47,591 (350)
Clique-to-Clique Monophonic Distance in Graphs
, 2018 It is shown that the clique-to-clique monophonic center a connected graph does not lie in a single block of G.
I. Keerthi Asir (5758471) +1 more
core +1 more source
‘A friend who stabs you’: Abjection, violence and the female clique in film
, 2020 This article establishes a unique subgenre of film (the ‘female clique film’) in which the clique (and its disruption) is central to the film’s plot. It discusses four female clique films – Heathers (1989), The Craft (1996), Jawbreaker (1999) and Mean ...
Gildersleeve, Jessica +1 more
core +1 more source
IEEE AccessMajor depressive disorder (MDD) is associated with complex disruptions in brain function, yet the underlying neural mechanisms remain incompletely understood. Traditional approaches to studying functional brain networks have primarily focused on pairwise
Semen A. Kurkin +6 more
doaj +1 more source
Clique Graphs and Edge-clique graphs
Electronic Notes in Discrete Mathematics, 2003 AbstractNot every edge-clique graph is a clique graph. 1 IntroductionLet Gbe a graph. The clique graph of G, K(G), is the intersection graph of thefamily of all maximal cliques of G. The edge-clique graph of G, K e (G), is theone whose vertices are the edges of G, two vertices being adjacent in K e (G),when the corresponding edges of G belong to a same
openaire +1 more source
Discrete Mathematics, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pavol Hell +1 more
openaire +1 more source
A Maximal Clique Based Multiobjective Evolutionary Algorithm for Overlapping Community Detection
IEEE Transactions on Evolutionary Computation, 2017 Detecting community structure has become one important technique for studying complex networks. Although many community detection algorithms have been proposed, most of them focus on separated communities, where each node can belong to only one community.
Xuyun Wen +7 more
semanticscholar +1 more source
Advanced Science, EarlyView.A non‐canonical core transcriptional regulatory circuit, composed of ID3, SMAD3, and NR2F2, drives Osimertinib resistance in non‐small cell lung cancer through super‐enhancer‐mediated activation of EPAS1, which couples neuroendocrine differentiation with ferroptosis evasion.
Aochu Liu +15 more
wiley +1 more source
An Efficient Influence Maximization Algorithm Based on Clique in Social Networks
IEEE Access, 2019 Influence Maximization is to find a subset of influential nodes so that they can spread influence to the largest range in a network. The study on influence maximization is of great importance, and many solutions have been developed, including greedy ...
Huan Li +3 more
doaj +1 more source
The maximum clique interdiction problem
European Journal of Operational Research, 2019 Given a graph G and an interdiction budget k, the Maximum Clique Interdiction Problem asks to find a subset of at most k vertices to remove from G so that the size of the maximum clique in the remaining graph is minimized.
Fabio Furini +3 more
semanticscholar +1 more source
The list chromatic number of graphs with small clique number [PDF]
J. Comb. Theory B, 2017 We prove that every triangle-free graph with maximum degree $\Delta$ has list chromatic number at most $(1+o(1))\frac{\Delta}{\ln \Delta}$. This matches the best-known bound for graphs of girth at least 5.
Michael Molloy
semanticscholar +1 more source