Results 11 to 20 of about 47,591 (350)
Clique Partitions and Clique Coverings
Discrete Mathematics, 1988 Only undirected graphs without loops or multiple edges are considered here. \(K_n\) is a clique on \(n\) vertices. The clique covering number and the clique partition number of the graph \(G\) is denoted by \(cc(G)\) and \(cp(G)\)respectively. The authors obtain asymptotic results for \(cp(K_n-K_m)\) for m in the range \(\sqrt{n}
Paul Erdös +2 more
openaire +3 more sources
On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs [PDF]
Discrete Applied Mathematics, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Liliana Alcón +3 more
core +4 more sources
On hereditary clique-Helly self-clique graphs
Discrete Applied Mathematics, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Francisco Larrión, Miguel A. Pizaña
openaire +2 more sources
On self-clique graphs with given clique sizes, II
Discrete Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gek Ling Chia, Poh-Hwa Ong
openaire +3 more sources
On self-clique graphs with given clique sizes
Discrete Mathematics, 2000 Let \(G\) be a finite simple graph and let the set of all its cliques be denoted by \({\mathfrak K}(G)\). The clique graph \(K(G)\) of \(G\) is the graph whose vertex set is \({\mathfrak K}(G)\) and two vertices are adjacent in \(K(G)\) iff the corresponding cliques have non-empty intersection; \(G\) is said to be self-clique if it is isomorphic to \(K(
G.L. Chia, Chia, G.L.
openaire +3 more sources
Parallel Clique Counting and Peeling Algorithms [PDF]
Conference on Applied and Computational Discrete Algorithms, 2020 Dense subgraphs capture strong communities in social networks and entities possessing strong interactions in biological networks. In particular, $k$-clique counting and listing have applications in identifying important actors in a graph.
Jessica Shi +2 more
semanticscholar +1 more source
Estudo do número de Ramsey R(3,10): análise de grafos de ordem 40
REMAT, 2023 O número de Ramsey R(k,l) é o menor número inteiro n tal que não exista (k,l,n,e)-grafo, sendo que um (k,l,n,e)-grafo denota um grafo G com n vértices e e arestas e com C(G)
Daniel Coswig Zitzke +3 more
doaj +3 more sources
Clique Transversal Variants on Graphs: A Parameterized-Complexity Perspective
Mathematics, 2023 The clique transversal problem and its variants have garnered significant attention in the last two decades due to their practical applications in communication networks, social-network theory and transceiver placement for cellular telephones.
Chuan-Min Lee
doaj +1 more source
Development of Stock Networks Using Part Mutual Information and Australian Stock Market Data
Entropy, 2020 Complex network is a powerful tool to discover important information from various types of big data. Although substantial studies have been conducted for the development of stock relation networks, correlation coefficient is dominantly used to measure ...
Yan Yan +3 more
doaj +1 more source
Circuit design for clique problem and its implementation on quantum computer
IET Quantum Communication, 2022 Finding cliques in a graph has a wide range of applications due to its pattern matching ability. The k‐clique problem, a subset of the clique problem, determines whether or not an arbitrary network has a clique of size k.
Arpita Sanyal Bhaduri +3 more
doaj +1 more source