Results 71 to 80 of about 17,360 (200)

Number of Subgraphs and Their Converses in Tournaments and New Digraph Polynomials

Journal of Graph Theory, Volume 110, Issue 2, Page 127-131, October 2025.
ABSTRACT An oriented graph D is converse invariant if, for any tournament T, the number of copies of D in T is equal to that of its converse − D. El Sahili and Ghazo Hanna [J. Graph Theory 102 (2023), 684‐701] showed that any oriented graph D with maximum degree at most 2 is converse invariant. They proposed a question: Can we characterize all converse
Jiangdong Ai, Gregory Gutin, Hui Lei, Anders Yeo, Yacong Zhou   +4 more
wiley   +1 more source

Matched Filters for Noisy Induced Subgraph Detection [PDF]

, 2018
The problem of finding the vertex correspondence between two noisy graphs with different number of vertices where the smaller graph is still large has many applications in social networks, neuroscience, and computer vision.
Lyzinski, Vince, Park, Youngser, Priebe, Carey E., Sussman, Daniel L.   +3 more
core  

On Endomorphism Universality of Sparse Graph Classes

Journal of Graph Theory, Volume 110, Issue 2, Page 223-244, October 2025.
ABSTRACT We show that every commutative idempotent monoid (a.k.a. lattice) is the endomorphism monoid of a subcubic graph. This solves a problem of Babai and Pultr and the degree bound is best‐possible. On the other hand, we show that no class excluding a minor can have all commutative idempotent monoids among its endomorphism monoids. As a by‐product,
Kolja Knauer, Gil Puig i Surroca
wiley   +1 more source

Longest cycles in vertex‐transitive and highly connected graphs

Bulletin of the London Mathematical Society, Volume 57, Issue 10, Page 2975-2990, October 2025.
Abstract We present progress on three old conjectures about longest paths and cycles in graphs. The first pair of conjectures, due to Lovász from 1969 and Thomassen from 1978, respectively, states that all connected vertex‐transitive graphs contain a Hamiltonian path, and that all sufficiently large such graphs even contain a Hamiltonian cycle.
Carla Groenland, Sean Longbrake, Raphael Steiner, Jérémie Turcotte, Liana Yepremyan   +4 more
wiley   +1 more source

Tight bounds for intersection‐reverse sequences, edge‐ordered graphs, and applications

Journal of the London Mathematical Society, Volume 112, Issue 4, October 2025.
Abstract In 2006, Marcus and Tardos proved that if A1,⋯,An$A^1,\dots,A^n$ are cyclic orders on some subsets of a set of n$n$ symbols such that the common elements of any two distinct orders Ai$A^i$ and Aj$A^j$ appear in reversed cyclic order in Ai$A^i$ and Aj$A^j$, then ∑i|Ai|=O(n3/2logn)$\sum _{i} |A^i|=O(n^{3/2}\log n)$.
Barnabás Janzer, Oliver Janzer, Abhishek Methuku, Gábor Tardos   +3 more
wiley   +1 more source

Fuzzy graphs and their applications in finding the best route, dominant node and influence index in a network under the hesitant bipolar-valued fuzzy environment

Complex & Intelligent Systems
This paper introduces the concept of hesitant bipolar-valued fuzzy graph (HBVFG), which captures the two opposing perspectives, namely the positive and negative opinions.
Jambi Ratna Raja, Jeong Gon Lee, Dhanraj Dhotre, Pravin Mane, Omprakash Sugdeo Rajankar, Antonios Kalampakas, Navin D. Jambhekar, D. G. Bhalke   +7 more
doaj   +1 more source

Genetic Algorithm-based Mapper to Support Multiple Concurrent Users on Wireless Testbeds

, 2016
Communication and networking research introduces new protocols and standards with an increasing number of researchers relying on real experiments rather than simulations to evaluate the performance of their new protocols.
Azmy, Michael, ElNainay, Mustafa, Elnakieb, Yaser A.   +2 more
core   +1 more source

Prosoluble subgroups of the profinite completion of the fundamental group of compact 3‐manifolds

Journal of the London Mathematical Society, Volume 112, Issue 4, October 2025.
Abstract We give a description of finitely generated prosoluble subgroups of the profinite completion of 3‐manifold groups and toral relatively hyperbolic virtually compact special groups.
Lucas C. Lopes, Pavel A. Zalesskii
wiley   +1 more source

The conjugacy problem for ascending HNN‐extensions of free groups

Proceedings of the London Mathematical Society, Volume 131, Issue 4, October 2025.
Abstract We give an algorithm to solve the Conjugacy Problem for ascending HNN‐extensions of free groups. To do this, we give algorithms to solve certain problems on dynamics of free group endomorphisms.
Alan D. Logan
wiley   +1 more source

Weighted Turán Theorems With Applications to Ramsey‐Turán Type of Problems

Journal of Graph Theory, Volume 110, Issue 1, Page 59-71, September 2025.
ABSTRACT We study extensions of Turán Theorem in edge‐weighted settings. A particular case of interest is when constraints on the weight of an edge come from the order of the largest clique containing it. These problems are motivated by Ramsey‐Turán type problems.
József Balogh, Domagoj Bradač, Bernard Lidický   +2 more
wiley   +1 more source