Results 51 to 60 of about 9,811 (181)
On wreathed lexicographic products of graphs
Discrete Mathematics, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Leveraging Co‐Occurrence to Improve Deep Learning Photo‐Identification in Social Animals
Ecology and Evolution, Volume 16, Issue 4, April 2026.Photo‐identification of social animals is traditionally manual and time‐intensive, and most deep learning approaches ignore the structured, encounter‐based way in which individuals are observed. We introduce a lightweight, model‐agnostic fusion method that combines image‐level classifier probabilities with global sighting priors and historical co ...
Alexander Barnhill +7 more
wiley +1 more source
The Distinguishing Number and Distinguishing Index of the Lexicographic Product of Two Graphs
Discussiones Mathematicae Graph Theory, 2018 The distinguishing number (index) D(G) (D′(G)) of a graph G is the least integer d such that G has a vertex labeling (edge labeling) with d labels that is preserved only by the trivial automorphism.
Alikhani Saeid, Soltani Samaneh
doaj +1 more source
QUANTUM AUTOMORPHISM GROUP OF THE LEXICOGRAPHIC PRODUCT OF FINITE REGULAR GRAPHS [PDF]
, 2015 We study the quantum automorphism group of the lexicographic product of two finite regular graphs, providing a quantum generalization of Sabidussi's structure theorem on the automorphism group of such a ...
Chassaniol, Arthur
core +2 more sources
On Parallel and Serial (Dis‐)Aggregation in System Dynamics Models
System Dynamics Review, Volume 42, Issue 2, April/June 2026.ABSTRACT Compartment models are widely used in system dynamics to analyze complex systems. However, determining an appropriate level of aggregation remains a methodological challenge. This paper explores how parallel and serial (dis‐)aggregation affect a model's ability to reproduce dynamics of interest, using the beer distribution game (BDG) as a case
Christian Marchetti, Andreas Größler
wiley +1 more source
A Lexicographic product for Signed Graphs [PDF]
, 2019 A signed graph is a pair = (G; ), where G = (V (G);E(G)) is a graph and E(G) {+1;−1} is the sign function on the edges of G. The notion of composition (also known as lexicographic product) of two signed graphs and = (H; ) already exists in ...
Brunetti, M, Cavaleri, M, Donno, A.
core
Graphical small cancellation and hyperfiniteness of boundary actions
Journal of the London Mathematical Society, Volume 113, Issue 4, April 2026.Abstract We study actions of (infinitely presented) graphical small cancellation groups on the Gromov boundaries of their coned‐off Cayley graphs. We show that a class of graphical small cancellation groups, including (infinitely presented) classical small cancellation groups, admit hyperfinite boundary actions, more precisely, the orbit equivalence ...
Chris Karpinski +2 more
wiley +1 more source
Novel Neutrosophic Cubic Graphs Structures With Application in Decision Making Problems
IEEE Access, 2019 Graphs allow us to study the different patterns of inside the data by making a mental image. The aim of this paper is to develop a neutrosophic cubic graph structure, which is the extension of neutrosophic cubic graphs.
Muhammad Gulistan +4 more
doaj +1 more source
Qubit‐Efficient Quantum Local Search for Combinatorial Optimization
Advanced Quantum Technologies, Volume 9, Issue 3, March 2026.We introduce a qubit‐efficient variational quantum algorithm for combinatorial optimization that adaptively uses from logarithmic to a linear number of qubits to implement quantum local search. The method encodes flip probabilities of spin groups into quantum amplitudes, enabling exploration of classically intractable neighborhoods while maintaining ...
Mikhail Podobrii +4 more
wiley +1 more source
Edge-Transitive Lexicographic and Cartesian Products
Discussiones Mathematicae Graph Theory, 2016 In this note connected, edge-transitive lexicographic and Cartesian products are characterized. For the lexicographic product G ◦ H of a connected graph G that is not complete by a graph H, we show that it is edge-transitive if and only if G is edge ...
Imrich Wilfried +3 more
doaj +1 more source