Cliques

A "Cliques" is a maximal complete subgraph within a network, where every pair of distinct vertices is connected by an edge, thus representing the most cohesive form of social or structural integration in graph-theoretic analysis.

1.6K

Publications

102.7K

Citations

3K

Authors

1.2K

Institutions

Publications per year

2017–2026

294

Variants

Clique

Authors

3K

  1. LQ
    Lu Qin

    University of Technology Sydney, Australia

    14 publications · 748 citations

    13

    h-index

  2. AB
    Andreas Brandstädt

    University of Rostock, Germany

    13 publications · 708 citations

    13

    h-index

  3. SB
    Sergiy Butenko

    Texas A&M University, United States

    13 publications · 1K citations

    13

    h-index

  4. JL
    Jayme L. Szwarcfiter

    Universidade Federal do Rio de Janeiro, Brazil

    15 publications · 288 citations

    11

    h-index

  5. FL
    F. Larrión

    Universidad Autónoma Metropolitana, Mexico

    11 publications · 252 citations

    11

    h-index

1–5 of 3K

Venues

  1. Discrete Mathematics

    94 publications · 3.7K citations

    31

    h-index

  2. Discrete Applied Mathematics

    70 publications · 3.5K citations

    31

    h-index

  3. Journal of Combinatorial Theory Series B

    38 publications · 2.3K citations

    22

    h-index

  4. Information Processing Letters

    28 publications · 1.2K citations

    19

    h-index

  5. SIAM Journal on Discrete Mathematics

    24 publications · 1.1K citations

    18

    h-index

1–5