Results 21 to 30 of about 135,666 (285)
Cliques in rank-1 random graphs: the role of inhomogeneity [PDF]
, 2019 We study the asymptotic behavior of the clique number in rank-1 inhomogeneous random graphs, where edge probabilities between vertices are roughly proportional to the product of their vertex weights.
Bogerd, Kay +2 more
core +2 more sources
PREDICTORS OF ADOLESCENT INVOLVEMENT IN CLIQUES AND GANGS
Anthropological Researches and Studies, 2021 Objectives. The gangs came to the attention of the authorities because of the criminal nature of some of them. To understand which are the appropriate measures to prevent and reduce gang delinquency, this paper aimed at identifying the predictors of ...
Flavia-Elena CIURBEA +2 more
doaj +1 more source
Determining what sets of trees can be the clique trees of a chordal graph [PDF]
, 2011 Chordal graphs have characteristic tree representations, the clique trees. The problems of finding one or enumerating them have already been solved in a satisfactory way. In this paper, the following related problem is studied: given a family T of trees,
de Caria, Pablo Jesús +1 more
core +2 more sources
Complex Hadamard graphs and Butson matrices
AKCE International Journal of Graphs and Combinatorics, 2023 This article introduces complex Hadamard graphs and studies their properties. Using the complete subgraphs of these complex Hadamard graphs, complex Hadamard matrices of order n are generated, where n is a multiple of four.
Briji Jacob Chathely, Rajendra P. Deore
doaj +1 more source
Empirical study on clique-degree distribution of networks [PDF]
, 2007 The community structure and motif-modular-network hierarchy are of great importance for understanding the relationship between structures and functions. In this paper, we investigate the distribution of clique-degree, which is an extension of degree and ...
Bing-Hong Wang +9 more
core +1 more source
Model Counting for Formulas of Bounded Clique-Width [PDF]
, 2013 We show that #SAT is polynomial-time tractable for classes of CNF formulas whose incidence graphs have bounded symmetric clique-width (or bounded clique-width, or bounded rank-width).
B. Courcelle +13 more
core +2 more sources
On the Average-case Complexity of Parameterized Clique [PDF]
, 2014 The k-Clique problem is a fundamental combinatorial problem that plays a prominent role in classical as well as in parameterized complexity theory. It is among the most well-known NP-complete and W[1]-complete problems.
Bollobás +22 more
core +2 more sources
Studi Fenomenologi Identitas Diri Anggota Clique
Jurnal Psikoedukasi dan Konseling, 2022 : This study aims to determine the meaning of forming the self-identity of students who are members of a clique at school. This study uses a qualitative method with a phenomenological approach.
Sylva Indah Kirana +2 more
doaj +1 more source
How Many Cliques Can a Clique Cover Cover?
The Electronic Journal of Combinatorics, 2023 This work examines the problem of clique enumeration on a graph by exploiting its clique covers. The principle of inclusion/exclusion is applied to determine the number of cliques of size $r$ in the graph union of a set $\mathcal{C} = \{c_1, \ldots, c_m\}$ of $m$ cliques. This leads to a deeper examination of the sets involved and to an orbit partition,
Shuldiner, Pavel, Oldford, R. Wayne
openaire +3 more sources
Optimal-size clique transversals in chordal graphs [PDF]
, 2018 The following question was raised by Tuza in 1990 and Erdos et al. in 1992: if every edge of an n-vertex chordal graph G is contained in a clique of size at least four, does G have a clique transversal, i.e., a set of vertices meeting all non-trivial ...
Andreae, Andreae, Erdős, Gavril, Tuza
core +2 more sources