Results 31 to 40 of about 11,127 (121)

On the diversity of test instances for studying branch‐and‐bound performance

Australian &New Zealand Journal of Statistics, Volume 67, Issue 4, Page 472-490, December 2025.
Summary In their paper ‘An Automatic Method for Solving Discrete Programming Problems’, Ailsa Land and Alison Doig developed a branch‐and‐bound method for solving the general case of the mixed integer linear programming (MIP) problem. A core part of the algorithm, branch variable selection, has received renewed attention in recent years with the ...
Simon Bowly, Kate Smith‐Miles
wiley   +1 more source

Eigenvalues of Relatively Prime Graphs Connected with Finite Quasigroups

Journal of Mathematics
A relatively new and rapidly expanding area of mathematics research is the study of graphs’ spectral properties. Spectral graph theory plays a very important role in understanding certifiable applications such as cryptography, combinatorial design, and ...
Muhammad Nadeem, Nwazish Ali, Hafiz Muhammad Bilal, Md. Ashraful Alam, M. I. Elashiry, Kholood Alnefaie   +5 more
doaj   +1 more source

Near-colorings: non-colorable graphs and NP-completeness [PDF]

, 2013
A graph G is (d_1,..,d_l)-colorable if the vertex set of G can be partitioned into subsets V_1,..,V_l such that the graph G[V_i] induced by the vertices of V_i has maximum degree at most d_i for all 1
Montassier, Mickael, Ochem, Pascal
core  

On Weakly 2-Invo Clean Rings With Some Properties in Graph Theory

International Journal of Mathematics and Mathematical Sciences
The concept of a weakly two-involution clean ring is presented; it is a generalization of two-involution clean ring, which allows the addition of more elements to a ring, which will be observed in its graph theoretic representation.
Salim Ghadeer Salim, Raida Dawood Mahmood, Ahmed Mohammed Ali   +2 more
doaj   +1 more source

Recognizing Trees From Incomplete Decks

Journal of Graph Theory, Volume 110, Issue 3, Page 322-336, November 2025.
ABSTRACT Given a graph G, the unlabeled subgraphs G − v are called the cards of G. The deck of G is the multiset { G − v : v ∈ V ( G ) }. Wendy Myrvold showed that a disconnected graph and a connected graph both on n vertices have at most ⌊ n 2 ⌋ + 1 cards in common and found (infinite) families of trees and disconnected forests for which this upper ...
Gabriëlle Zwaneveld
wiley   +1 more source

Quantum approximate optimization algorithms for maximum cut on low-girth graphs

Physical Review Research
Maximum cut (MaxCut) on graphs is a classic NP-hard problem. In quantum computing, Farhi, Gutmann, and Goldstone proposed the quantum approximate optimization algorithm (QAOA) for solving the MaxCut problem.
Tongyang Li, Yuexin Su, Ziyi Yang, Shengyu Zhang   +3 more
doaj   +1 more source

Local algorithms, regular graphs of large girth, and random regular graphs

, 2016
We introduce a general class of algorithms and supply a number of general results useful for analysing these algorithms when applied to regular graphs of large girth. As a result, we can transfer a number of results proved for random regular graphs into (
Hoppen, Carlos, Wormald, Nicholas
core   +1 more source

Analysis Of The Girth For Regular Bi-partite Graphs With Degree 3 [PDF]

, 2013
The goal of this paper is to derive the detailed description of the Enumeration Based Search Algorithm from the high level description provided in [16], analyze the experimental results from our implementation of the Enumeration Based Search Algorithm ...
Nittoor, Vivek S, Suda, Reiji
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

Graphical small cancellation groups with the Haagerup property [PDF]

, 2014
We prove the Haagerup property (= Gromov's a-T-menability) for finitely generated groups defined by infinite presentations satisfying the graphical C'(lambda)-small cancellation condition with respect to graphs endowed with a compatible wall structure ...
Arzhantseva, Goulnara, Osajda, Damian
core