Results 61 to 70 of about 6,109 (206)
Simple graph models of information spread in finite populations [PDF]
We consider several classes of simple graphs as potential models for information diffusion in a structured population. These include biases cycles, dual circular flows, partial bipartite graphs and what we call ‘single-link’ graphs.
Burton Voorhees, Bergerud Ryder
doaj +1 more source
Properly Colored Cycles in Edge‐Colored Balanced Bipartite Graphs
ABSTRACT Let G n , n c ${G}_{n,n}^{c}$ denote a (not necessarily properly) edge‐colored balanced bipartite graph on 2 n $2n$ vertices, that is, in which every edge is assigned a color. A cycle C $C$ in G n , n c ${G}_{n,n}^{c}$ is called properly colored if any two consecutive edges of C $C$ have distinct colors. A properly colored cycle‐factor of G n ,
Tingting Han +3 more
wiley +1 more source
In this paper, we determine the unique graph whose least signless Laplacian eigenvalue attains the minimum among all non-bipartite unicyclic graphs of order n with maximum degree Δ and among all non-bipartite connected graphs of order n with maximum ...
Shu-Guang Guo, Rong Zhang
doaj +1 more source
Another Proof of the Generalized Tutte—Berge Formula for f $f$‐Bounded Subgraphs
ABSTRACT Given a nonnegative integer weight f ( v ) $f(v)$ for each vertex v $v$ in a multigraph G $G$, an f $f$‐bounded subgraph of G $G$ is a multigraph H $H$ contained in G $G$ such that d H ( v ) ≤ f ( v ) ${d}_{H}(v)\le f(v)$ for all v ∈ V ( G ) $v\in V(G)$.
Zishen Qu, Douglas B. West
wiley +1 more source
Abstract Acoustic cameras, or imaging sonars, are often used to monitor marine energy sites in regions where the water is too dark or turbid for optical sensing. To do so more effectively, scientists are investigating automated detection methodologies to use on these data.
Theodore Nowak +2 more
wiley +1 more source
ABSTRACT The analysis of certain properties of the underlying graph of a public transport network generates insights about the network's structure. Hereby, the choice of the graph representation depends on a trade‐off between complexity reduction and information preservation to adequately model a public transport network.
Michael Palk +2 more
wiley +1 more source
Bipartite Toughness and k-Factors in Bipartite Graphs
We define a new invariant tB(G) in bipartite graphs that is analogous to the toughness t(G) and we give sufficient conditions in term of tB(G) for the existence of k-factors in bipartite graphs. We also show that these results are sharp.
Guizhen Liu +3 more
doaj +1 more source
Stratified sampling enhances the understanding of bat–fruit networks in the southern Atlantic Forest
Few studies have sought to understand the vertical patterns of bat–fruit systems, and therefore, it is not possible to evaluate whether interpretations based on data collected from a single stratum adequately represent the interaction patterns of this system. In this context, we evaluated the dissimilarity in the assemblage of frugivorous bats, plants,
Karolaine Porto Supi +3 more
wiley +1 more source
Abstract Protected areas represent complex social‐ecological systems that require governance and management approaches that valorise and enhance positive relationships between people and nature. This study analyses the alignment between social and ecological systems to detect the social‐ecological fit of projects focused on biodiversity conservation ...
Elena Andriollo +4 more
wiley +1 more source
A Universal Meta‐Heuristic Framework for Influence Maximisation in Hypergraphs
ABSTRACT Influence maximisation (IM) aims to select a small number of nodes that are able to maximise their influence in a network and covers a wide range of applications. Despite numerous attempts to provide effective solutions in simple networks, higher‐order interactions between entities in various real‐world systems are usually not taken into ...
Ming Xie +5 more
wiley +1 more source

