Results 31 to 40 of about 47,591 (350)
On Several Parameters of Super Line Graph
Axioms, 2023 The super line graph of index r, denoted by Lr(G), is defined for any graph G with at least r edges. Its vertices are the sets of r edges of G, and two such sets are adjacent if an edge of one is adjacent to an edge of the other.
Jiawei Meng +2 more
doaj +1 more source
Galois groups of chromatic polynomials of strongly non-clique-separable graphs of order at most 10
, 2022 The chromatic polynomial P(G, λ) gives the number of proper colourings of a graph in at most λ colours. A graph G is clique-separable if it can be obtained by identifying an r-clique in a graph H 1 with an r-clique in a graph H 2.
K Morgan (13134483)
core +1 more source
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
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
On self-clique graphs with triangular cliques
Discrete Mathematics, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Francisco Larrión +2 more
openaire +2 more sources
Clique densification in networks
Physical Review E, 2023 14 pages, 11 figures.
Haochen Pi +3 more
openaire +3 more sources
A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem [PDF]
IEEE Annual Symposium on Foundations of Computer Science, 2016 We prove that with high probability over the choice of a random graph G from the Erdös-Rényi distribution G(n,1/2), the nO(d)-time degree d Sum-of-Squares semidefinite programming relaxation for the clique problem will give a value of at least n1/2-c(d/
B. Barak +5 more
semanticscholar +1 more source
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
Random Structures & Algorithms, 2009 AbstractDerényi, Palla and Vicsek introduced the following dependent percolation model, in the context of finding communities in networks. Starting with a random graph Ggenerated by some rule, form an auxiliary graph G′ whose vertices are the k‐cliques of G, in which two vertices are joined if the corresponding cliques share k – 1 vertices.
Bollobas, B, Riordan, O
openaire +4 more sources
Clique-Width for Hereditary Graph Classes [PDF]
BCC, 2019 Clique-width is a well-studied graph parameter owing to its use in understanding algorithmic tractability: if the clique-width of a graph class ${\cal G}$ is bounded by a constant, a wide range of problems that are NP-complete in general can be shown to ...
Konrad K. Dabrowski +2 more
semanticscholar +1 more source