Results 81 to 90 of about 59,275 (246)
Abstract Quantifying the structure and dynamics of species interactions in ecological communities is fundamental to studying ecology and evolution. While there are numerous approaches to analysing ecological networks, there is not yet an approach that can (1) quantify dissimilarity in the global structure of ecological networks that range from ...
Kai M. Hung +4 more
wiley +1 more source
Hereditary Equality of Domination and Exponential Domination
We characterize a large subclass of the class of those graphs G for which the exponential domination number of H equals the domination number of H for every induced subgraph H of G.
Henning Michael A. +2 more
doaj +1 more source
$\mathcal{B}$-Partitions, determinant and permanent of graphs [PDF]
Let $G$ be a graph (directed or undirected) having $k$ number of blocks $B_1, B_2,\hdots,B_k$. A $\mathcal{B}$-partition of $G$ is a partition consists of $k$ vertex-disjoint subgraph $(\hat{B_1},\hat{B_1},\hdots,\hat{B_k})$ such that $\hat{B}_i$ is an ...
Ranveer Singh, Ravindra Bapat
doaj +1 more source
On maximum planar induced subgraphs
AbstractThe nonplanar vertex deletion or vertex deletion vd(G) of a graph G is the smallest nonnegative integer k, such that the removal of k vertices from G produces a planar graph G′. In this case G′ is said to be a maximum planar induced subgraph of G.
Jorge Stolfi +4 more
openaire +2 more sources
A complex network perspective on brain disease
ABSTRACT If brain anatomy and dynamics have a complex network structure as it has become standard to posit, it is reasonable to assume that such a structure should play a key role not only in brain function but also in brain dysfunction. However, exactly how network structure is implicated in brain damage and whether at least some pathologies can be ...
David Papo, Javier M. Buldú
wiley +1 more source
Heavy subgraph pairs for traceability of block-chains
A graph is called traceable if it contains a Hamilton path, i.e., a path containing all its vertices. Let G be a graph on n vertices. We say that an induced subgraph of G is o−1-heavy if it contains two nonadjacent vertices which satisfy an Ore-type ...
Li Binlong +2 more
doaj +1 more source
Algoritma matching bobot maskimum dalam graph bipartit komplit berboto [PDF]
ABSTRAK Suatu matching dalam graph G adalah subgraph 1-regular pada G yang disebabkan oleh kumpulan dart pasangan garis yang tidak adjacent. Suatu matching merupakan matching maksimum bila matching tersebut mempunyai harga pokok maksimum. Matching dalam
Astuti , Yani Parti
core
Abstract In graph‐restricted cooperative games, a group of agents, represented by the nodes of a graph, work together to make a profit. However, two agents can cooperate within a coalition only if they are connected by the graph in the coalition. Several allocation rules have been proposed for these games, but there is something in common in all of ...
Antonio C. Alarcón +2 more
wiley +1 more source
Doubly Nonnegative and Semidefinite Relaxations for the Densest k-Subgraph Problem
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
Geospatial mapping of urban utility networks integrating street view images and design rules
Abstract Urban utility networks (e.g., electric power networks [EPN] and water distribution networks [WDN]) are critical for urban management, yet large‐scale geospatial mapping of their topologies remains challenging. To this end, an intelligent method integrating street view images and design rules is proposed to generate geospatial mapping of EPN ...
Furong Zhang +4 more
wiley +1 more source

