Results 81 to 90 of about 47,591 (350)
Local Community Detection Based on Small Cliques
Algorithms, 2017 Community detection aims to find dense subgraphs in a network. We consider the problem of finding a community locally around a seed node both in unweighted and weighted networks.
Michael Hamann +2 more
doaj +1 more source
Note on structural properties of graphs
Open Mathematics, 2022 In this paper, we establish sufficient and necessary conditions for the existence of abelian subgroups of maximal order of a finite group GG, by means of its commuting graph.
Arreola-Bautista Luis D. +3 more
doaj +1 more source
Crossings, Colorings, and Cliques [PDF]
The Electronic Journal of Combinatorics, 2009 Albertson conjectured that if graph $G$ has chromatic number $r$, then the crossing number of $G$ is at least that of the complete graph $K_r$. This conjecture in the case $r=5$ is equivalent to the four color theorem. It was verified for $r=6$ by Oporowski and Zhao. In this paper, we prove the conjecture for $7 \leq r \leq 12$ using results of Dirac;
Michael O. Albertson +2 more
openaire +3 more sources
On clique‐inverse graphs of graphs with bounded clique number [PDF]
Journal of Graph Theory, 2020 AbstractThe clique graph K(G) of G is the intersection graph of the family of maximal cliques of G. For a family of graphs, the family of clique‐inverse graphs of , denoted by , is defined as . Let be the family of Kp‐free graphs, that is, graphs with clique number at most p − 1, for an integer constant p ≥ 2.
Liliana Alcón +4 more
openaire +4 more sources
Clique topology reveals intrinsic geometric structure in neural correlations [PDF]
Proceedings of the National Academy of Sciences of the United States of America, 2015 Significance Detecting structure in neural activity is critical for understanding the function of neural circuits. The coding properties of neurons are typically investigated by correlating their responses to external stimuli.
Chad Giusti +3 more
semanticscholar +1 more source
The Anatomical Record, EarlyView.Abstract Arhinolemur scalabrinii† Ameghino, 1898 was originally described as a strepsirrhine primate (Mammalia) but has been recognized as an anostomid fish since 2012. It remains the only extinct anostomid species known from complete cranial material.
Karen M. Panzeri +8 more
wiley +1 more source
Cliques and Clique Covers in Interval-Valued Fuzzy Graphs
International Journal of Computational Intelligence Systems, 2021 Finding cliques and clique covers in graphs are one of the most needful tasks. In this paper, interval-valued fuzzy cliques (IVFQs) and interval-valued fuzzy clique covers (IVFQCs) of an interval-valued fuzzy graph (IVFG) are introduced by introducing ...
Napur Patra +3 more
doaj +1 more source
Online Clique Clustering [PDF]
Algorithmica, 2019 Abstract Clique clustering is the problem of partitioning the vertices of a graph into disjoint clusters, where each cluster forms a clique in the graph, while optimizing some objective function. In online clustering, the input graph is given one vertex at a time, and any vertices that have previously been clustered together are not allowed to be ...
Chrobak, Marek +3 more
openaire +6 more sources
Business Strategy and the Environment, EarlyView.ABSTRACT Despite growing interest in corporate relocation decisions and sustainability, the existing literature is limited in its consumer‐centric approach. Integrating social exchange theory and construal level theory, this research investigates how consumers perceive sustainability‐driven nearshoring motives (i.e., socio‐economic vs.
Cagla Dayangan +2 more
wiley +1 more source
Towards a Complexity Theory for the Congested Clique [PDF]
ACM Symposium on Parallelism in Algorithms and Architectures, 2017 The congested clique model of distributed computing has been receiving attention as a model for densely connected distributed systems. While there has been significant progress on the side of upper bounds, we have very little in terms of lower bounds for
Janne H. Korhonen, J. Suomela
semanticscholar +1 more source