Results 151 to 160 of about 2,715,030 (252)
Locally 3-arc-transitive regular covers of complete bipartite graphs
, 2016 In this paper, locally 3-arc-transitive regular covers of complete bipartite graphs are studied, and results are obtained that apply to arbitrary covering transformation groups.
Swartz, Eric
core +1 more source
Hitting Times in the Binomial Random Graph
Journal of Graph Theory, Volume 113, Issue 2, Page 377-393, October 2026.ABSTRACT Fix k ≥ 2 , choose log n n ( k − 1 ) ∕ k ≤ p ≤ 1 − Ω ( log 4 n n )
wiley +1 more source
On the Hardness of Switching to a Small Number of Edges
Journal of Graph Theory, Volume 113, Issue 2, Page 237-251, October 2026.ABSTRACT Seidel's switching is a graph operation which makes a given vertex adjacent to precisely those vertices to which it was non‐adjacent before, while keeping the rest of the graph unchanged. Two graphs are called switching‐equivalent if one can be made isomorphic to the other one by a sequence of switches. Jelínková et al. [DMTCS 13, no. 2, 2011]
Vít Jelínek +2 more
wiley +1 more source
Some properties of the cycle graph of complete graphs and complete bipartite graphs
, 2001 This paper is an exposition of the article entitled Cycle Graph taken from the journal Transactions of the National Academy of Science and Technology , vol. VI (1984) by Dr. Severino V. Gervacio.
Resoso, Melvin Z. +1 more
core
Robustness of the Sauer–Spencer Theorem
Random Structures &Algorithms, Volume 69, Issue 3, October 2026.ABSTRACT We prove a robust version of a graph embedding theorem of Sauer and Spencer. To state this sparser analogue, we define G(p)$$ G(p) $$ to be a random subgraph of G$$ G $$ obtained by retaining each edge of G$$ G $$ independently with probability p∈[0,1]$$ p\in \left[0,1\right] $$, and let m1(H)$$ {m}_1(H) $$ be the maximum 1‐density of a graph ...
Peter Allen +3 more
wiley +1 more source
On the Local Resilience of Random Geometric Graphs With Respect to Connectivity and Long Cycles
Random Structures &Algorithms, Volume 69, Issue 3, October 2026.ABSTRACT Given an increasing graph property 𝒫, a graph G$$ G $$ is α$$ \alpha $$‐resilient with respect to 𝒫 if, for every spanning subgraph H⊆G$$ H\subseteq G $$ where each vertex keeps more than a (1−α)$$ \left(1-\alpha \right) $$‐proportion of its neighbors, H$$ H $$ has property 𝒫.
Alberto Espuny Díaz +2 more
wiley +1 more source
Ethnic integration and the value of innovation
Strategic Management Journal, Volume 47, Issue 10, Page 2792-2820, October 2026.Abstract Research Summary Organizations have become increasingly ethnically diverse, and this diversity often brings together distinct technological competencies. Understanding how firms can leverage such diversity to produce valuable innovations therefore becomes essential.
Stefano Breschi +2 more
wiley +1 more source
Optimising daily sampling of plant–bee interaction networks
Journal of Animal Ecology, Volume 95, Issue 10, Page 1903-1918, October 2026.Daily variation in ecological interaction networks is rarely quantified due to limited temporal sampling, yet network structure may change substantially within a single day. We show that plant–bee networks exhibit strong intraday shifts in composition and structure, and that sampling distributed across key daily periods better captures network ...
Caio S. Ballarin +6 more
wiley +1 more source
The R203W substitution drives PACS‐1 syndrome by disrupting intramolecular regulation
The FEBS Journal, Volume 293, Issue 19, Page 5717-5734, October 2026.The middle region (MR) of PACS‐1 controls engagement with specific partner proteins. This manuscript presents the structure of the Furin binding region (FBR) and how interactions with partners are regulated through the interplay between a basic patch in the FBR and an acidic cluster in the MR.
Troy C. Krzysiak +7 more
wiley +1 more source
Further results on the radio number for some construction of the path, complete, and complete bipartite graphs. [PDF]
HeliyonMari B, Jeyaraj RS.
europepmc +1 more source