Results 171 to 180 of about 5,057 (262)
The Independence Ratio of 4‐Cycle‐Free Planar Graphs
Journal of Graph Theory, Volume 112, Issue 2, Page 116-127, June 2026.ABSTRACT We prove that every n‐vertex planar graph G with no triangle sharing an edge with a 4‐cycle has independence ratio n ∕ α ( G ) ≤ 4 − ε for ε = 1 ∕ 30. This result implies that the same bound holds for 4‐cycle‐free planar graphs and planar graphs with no adjacent triangles and no triangle sharing an edge with a 5‐cycle.
Tom Kelly +3 more
wiley +1 more source
Networks, Volume 87, Issue 4, Page 343-371, June 2026.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
Finding Maximum Weight 2‐Packing Sets on Arbitrary Graphs
Networks, Volume 87, Issue 4, Page 404-427, June 2026.ABSTRACT A 2‐packing set for an undirected, weighted graph G=(V,E,w) is a subset 𝒮⊆V such that any two vertices v1,v2∈𝒮 are not adjacent and have no common neighbors. The Maximum Weight 2‐Packing Set problem that asks for a 2‐packing set of maximum weight is NP‐hard.
Jannick Borowitz +2 more
wiley +1 more source
A Resource Efficient Ising Model‐Based Quantum Sudoku Solver
Software: Practice and Experience, Volume 56, Issue 6, Page 643-657, June 2026.ABSTRACT Background Quantum algorithms exploit superposition and parallelism to address complex combinatorial problems, many of which fall into the non‐polynomial (NP) class. Sudoku, a widely known logic‐based puzzle, is proven to be NP‐complete and thus presents a suitable testbed for exploring quantum optimization approaches.
Wen‐Li Wang +5 more
wiley +1 more source
Text Mining in Bibliometrics and Science Mapping: A Methodological Review
WIREs Computational Statistics, Volume 18, Issue 2, June 2026.Text mining has become a foundational component of contemporary bibliometrics and science mapping, enabling systematic analysis of the semantic structure, thematic evolution, and cognitive organization of scientific fields. Integrating textual evidence with relational indicators enriches knowledge maps and supports more comprehensive, content‐sensitive
Michelangelo Misuraca
wiley +1 more source
Exploring the Potential of Calebin‐A in Targeting Obesity‐Related Genes and Pathways
Journal of Cellular and Molecular Medicine, Volume 30, Issue 11, June 2026.ABSTRACT Obesity is a global health crisis affecting millions, associated with metabolic disorders such as type 2 diabetes and cardiovascular disease. Calebin‐A, a bioactive compound derived from Curcuma species, has shown promise in managing obesity and its complications.
Ali Mahmoudi +4 more
wiley +1 more source
Bulletin of the London Mathematical Society, Volume 58, Issue 6, June 2026.Abstract Given r⩾3$r \geqslant 3$, we prove that there exists λ>0$\lambda >0$ depending only on r$r$ so that if G$G$ is a metric graph of rank r$r$ with metric entropy 1, then there exists a proper subgraph H$H$ of G$G$ with metric entropy at least λ$\lambda$. This answers a question of the second two authors together with Rieck. We interpret this as a
Tawfiq Hamed, Tarik Aougab, Matt Clay
wiley +1 more source
The N‐prime graph and the Subgroup Isomorphism Problem
Journal of the London Mathematical Society, Volume 113, Issue 6, June 2026.Abstract We introduce a directed graph related to a group G$G$, which we call the N‐prime graph ΓN(G)$\Gamma _{\rm {N}}(G)$ of G$G$ and is a refinement of the classical Gruenberg–Kegel graph. The vertices of ΓN(G)$\Gamma _{\rm {N}}(G)$ are the primes p$p$ such that G$G$ has an element of order p$p$, and, for distinct vertices p$p$ and q$q$, the arc q→p$
Emanuele Pacifici +2 more
wiley +1 more source
Towards the boundary of the fine curve graph
Journal of Topology, Volume 19, Issue 2, June 2026.Abstract The fine curve graph was introduced as a geometric tool to study homeomorphisms of surfaces. In this paper, we study the Gromov boundary of this space and the local topology near points associated with certain foliations and laminations. We then give several applications including finding dynamically explicit elements with positive stable ...
Jonathan Bowden +2 more
wiley +1 more source
Induced Subgraphs of Johnson Graphs
, 2006 The Johnson graph J(n, N) is defined as the graph whose vertices are the nsubsets of the set {1, 2, · · · , N}, where two vertices are adjacent if they share exactly n−1 elements.
Ramin Naimi, Jeffrey Shaw
core