Results 241 to 250 of about 25,343 (293)

On the Hardness of Switching to a Small Number of Edges

open access: yesJournal 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

The Staging Model in Psychosis and Preventive Interventions: An Emerging Field With Debates on Conceptual Models and Interpretation of the Evidence Base. [PDF]

open access: yesEarly Interv Psychiatry
van der Gaag M   +10 more
europepmc   +1 more source

Lithology Controls on Arbuscular Mycorrhizal Fungi Across Bulk Soil and Rock-Soil Interface. [PDF]

open access: yesMicroorganisms
Pan R   +9 more
europepmc   +1 more source

Hepatitis C virus transmission among people who inject drugs in rural United States: mathematical modeling study using stochastic agent-based network simulation. [PDF]

open access: yesAm J Epidemiol
Zhu L   +12 more
europepmc   +1 more source

Home - About - Disclaimer - Privacy