DeepAI AI Chat
Log In Sign Up

Graphs without 2-community structures

by   Cristina Bazgan, et al.
University of Portsmouth

In the context of community structure detection, we study the existence of a partition of the vertex set of a graph into two parts such that each part is a community, namely a 2-community structure. We use the definition of a community where each vertex of the graph has a larger proportion of neighbors in its community than in the other community. There are few results about this problem, and it was not known if there exist graphs without 2-community structures, except stars. In this paper, we present a class of graphs without 2-community structures and leave some interesting open questions about the problem.


page 1

page 2

page 3

page 4


Finding k-community structures in special graph classes

For a fixed integer k≥ 2, a k-community structure in an undirected graph...

Sparse Partial Least Squares for Coarse Noisy Graph Alignment

Graph signal processing (GSP) provides a powerful framework for analyzin...

Inferring community characteristics in labelled networks

Labelled networks form a very common and important class of data, natura...

A Reinforcement Approach for Detecting P2P Botnet Communities in Dynamic Communication Graphs

Peer-to-peer (P2P) botnets use decentralized command and control network...

Homomorphisms of (n,m)-graphs with respect to generalised switch

An (n,m)-graph has n different types of arcs and m different types of ed...

Algorithms for weighted independent transversals and strong colouring

An independent transversal (IT) in a graph with a given vertex partition...