Results 101 to 110 of about 63,637 (247)
On induced subgraphs with odd degrees
Discrete Mathematics, 1994 AbstractSolving a problem of Alon, we prove that every graph G on n vertices with δ(G)⩾1 contains an induced subgraph H such that all the degrees in H are odd and |V(H)|⩾(1−o(1))n6.
openaire +2 more sources
Complexity of the Directed Robust b‐Matching Problem and Its Variants on Different Graph Classes
Networks, EarlyView.ABSTRACT The b$$ b $$‐matching problem is a well‐known generalization of the classical matching problem with various applications in operations research and computer science. Given an undirected graph, each vertex v$$ v $$ has a capacity bv$$ {b}_v $$, indicating the maximum number of times it can be matched, while edges can also be used multiple times.
Jenny Segschneider, Arie M. C. A. Koster
wiley +1 more source
New results on connected dominating structures in graphs
Acta Universitatis Sapientiae: Informatica, 2019 A set of vertices in a graph is a dominating set if every vertex not in the set is adjacent to at least one vertex in the set. A dominating structure is a subgraph induced by the dominating set.
Samuel Libin Chacko, Joseph Mayamma
doaj +1 more source
An Implicit Enumeration Approach for Maximum Ratio Clique Relaxations
Networks, EarlyView.ABSTRACT This article proposes an implicit enumeration approach to solve the maximum ratio s$$ s $$‐plex and the maximum ratio s$$ s $$‐defective clique problems. The approach is inspired by the classical Bron‐Kerbosch algorithm for enumerating all maximal cliques in a graph, which is extended to enumerating structures that are hereditary on induced ...
Yehor Blokhin +4 more
wiley +1 more source
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
Towards a Semiautonomous Young Spruce Forest Late Cleaning
Journal of Field Robotics, EarlyView.ABSTRACT Cleaning a seedling spruce stand is an important silvicultural task required to help the young spruce trees thrive. It is usually manual work with a clearing saw. Mechanized solutions have been proposed, but they have not worked out well, since the driver has challenges in seeing the seedling trees that should be left growing.
Issouf Ouattara +3 more
wiley +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
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
Solving Local Linear Systems with Boundary Conditions Using Heat Kernel Pagerank
, 2015 We present an efficient algorithm for solving local linear systems with a boundary condition using the Green's function of a connected induced subgraph related to the system.
Chung, Fan, Simpson, Olivia
core +1 more source