Results 111 to 120 of about 8,313 (308)
Doubly Nonnegative and Semidefinite Relaxations for the Densest k-Subgraph Problem
Entropy, 2019 The densest k-subgraph (DkS) maximization problem is to find a set of k vertices with maximum total weight of edges in the subgraph induced by this set. This problem is in general NP-hard. In this paper, two relaxation methods for solving the DkS problem
Chuan-Hao Guo, Yuan Guo, Bei-Bei Liu
doaj +1 more source
Divisive Algorithm Based on Node Clustering Coefficient for Community Detection
IEEE Access, 2020 This paper studies the relationship between the clustering coefficient of nodes and the community structure of the network. Communities in a network are regarded as node-induced subgraphs of the network in this study.
Qingbin Ji, Deyu Li, Zhen Jin
doaj +1 more source
Induced subgraphs of given sizes
Discrete Mathematics, 1999 This paper considers certain ``natural'' generalizations of ``Turán-type'' extremal problems investigated earlier by \textit{P. Erdős} [Extremal problems in graph theory. Theory Graphs Appl., Proc. Symp. Smolenice 1963, 29-36 (1964; Zbl 0161.20501)] and by \textit{P. Erdős, V. T. Sós}, and the reviewer [Some extremal problems on \(r\)-graphs.
Paul Erdös +3 more
openaire +1 more source
Linear Versus Centred Colouring via Pseudogrids
Journal of Graph Theory, EarlyView.ABSTRACT A centred colouring of a graph is a vertex colouring in which every connected subgraph contains a vertex whose colour is unique and a linear colouring is a vertex colouring in which every (not‐necessarily induced) path contains a vertex whose colour is unique. For a graph G $G$, the centred chromatic number χ cen ( G ) ${\chi }_{\text{cen}}(G)$
Prosenjit Bose +4 more
wiley +1 more source
A graph theoretical analysis of the number of edges in k-dense graphs
Electronic Journal of Graph Theory and Applications, 2016 Due to the increasing discovery and implementation of networks within all disciplines of life, the study of subgraph connectivity has become increasingly important.
Linda Eroh +4 more
doaj +1 more source
Journal of Graph Theory, EarlyView.ABSTRACT In an effort to understand the complexity of the maximum independent set problem, Chvátal introduced t‐perfect graphs. While a full characterization of this class remains open, important progress has been made for claw‐free graphs [Bruhn and Stein, Math. Program. 2012] and P 5 ${P}_{5}$‐free graphs [Bruhn and Fuchs, SIAM J. Discrete Math. 2017]
Yixin Cao, Shenghua Wang
wiley +1 more source
Theory and Applications of GraphsA class G of graphs is called hereditary if it is closed under taking induced subgraphs. We denote by G^{apex} the class of graphs G that contain a vertex v such that G − v is in G.
Jagdeep Singh +2 more
doaj +1 more source
The Phylogeny Graphs of Doubly Partial Orders
Discussiones Mathematicae Graph Theory, 2013 The competition graph of a doubly partial order is known to be an interval graph. The CCE graph and the niche graph of a doubly partial order are also known to be interval graphs if the graphs do not contain a cycle of length four and three as an induced
Park Boram, Sano Yoshio
doaj +1 more source
The graph grabbing game on {0,1}-weighted graphs
Results in Applied Mathematics, 2019 The graph grabbing game is a two-player game on a weighted connected graph in which two players, Alice and Bob, alternatively remove non-cut vertices one by one to gain the weights on them.
Soogang Eoh, Jihoon Choi
doaj +1 more source
On-line maximum-order induced hereditary subgraph problems
, 2005 We first study the competitive ratio for the on-line version of the problem of finding a maximum-order induced subgraph satisfying some hereditary property, under the hypothesis that the input graph is revealed by clusters.
Paschos, Vangelis +2 more
core +1 more source