Results 21 to 30 of about 3,761 (106)
The Generic Circular Triangle‐Free Graph
Journal of Graph Theory, Volume 109, Issue 4, Page 426-445, August 2025.ABSTRACT In this article, we introduce the generic circular triangle‐free graph C 3 and propose a finite axiomatization of its first‐order theory. In particular, our main results show that a countable graph G embeds into C 3 if and only if it is a { K 3 , K 1 + 2 K 2 , K 1 + C 5 , C 6 }‐free graph.
Manuel Bodirsky, Santiago Guzmán‐Pro
wiley +1 more source
Control Principles of Complex Networks
, 2016 A reflection of our ultimate understanding of a complex system is our ability to control its behavior. Typically, control has multiple prerequisites: It requires an accurate map of the network that governs the interactions between the system's components,
Barabási, Albert-Laszló, Liu, Yang-Yu
core +1 more source
Periodic Orbits of MAX and MIN Multistate Networks
Mathematical Methods in the Applied Sciences, Volume 48, Issue 12, Page 11620-11629, August 2025.ABSTRACT This work presents a generalization of Boolean networks to multistate networks over a complement‐closed set 𝒞, which can be finite or infinite. Specifically, we focus on MAX (and MIN) multistate networks, whose dynamics are governed by global arbitrary 𝒞‐maxterm (or 𝒞‐minterm) functions, which extend the well‐known maxterm (or minterm) Boolean
Juan A. Aledo +3 more
wiley +1 more source
Trivalent Graph isomorphism in polynomial time [PDF]
, 2012 It's important to design polynomial time algorithms to test if two graphs are isomorphic at least for some special classes of graphs. An approach to this was presented by Eugene M. Luks(1981) in the work \textit{Isomorphism of Graphs of Bounded Valence
Mena, Adria Alcala
core +2 more sources
Sequentially Constrained Hamilton Cycles in Random Graphs
Random Structures &Algorithms, Volume 67, Issue 1, August 2025.ABSTRACT We discuss the existence of Hamilton cycles in the random graph Gn,p$$ {G}_{n,p} $$ where there are restrictions caused by (i) coloring sequences, (ii) a subset of vertices must occur in a specific order, and (iii) there is a bound on the number of inversions in the associated permutation.
Alan Frieze, Wesley Pegden
wiley +1 more source
Bijections and symmetries for the factorizations of the long cycle [PDF]
, 2011 We study the factorizations of the permutation $(1,2,...,n)$ into $k$ factors of given cycle types. Using representation theory, Jackson obtained for each $k$ an elegant formula for counting these factorizations according to the number of cycles of each ...
Alejandro, H. Morales, Olivier Bernardi
core +1 more source
Methods in Ecology and Evolution, Volume 16, Issue 8, Page 1851-1867, August 2025.Abstract Being able to infer the interactions between a set of species from observations of the system is of paramount importance to obtain explanatory and predictive models in ecology. We tackled this challenge by employing qualitative modelling frameworks and logic methods for the synthesis of mathematical models that can integrate both observations ...
Loïc Paulevé, Cédric Gaucherel
wiley +1 more source
Mathematical Methods in the Applied Sciences, Volume 48, Issue 7, Page 7550-7567, 15 May 2025.Forensic linguistics and stylometry have in the exploration of linguistic patterns one of their fundamental tools. Mathematical structures such as complex multilayer networks and hypergraphs provide remarkable resources to represent and analyze texts.
Ángeles Criado‐Alonso +3 more
wiley +1 more source
Equitable List Coloring of Planar Graphs With Given Maximum Degree
Journal of Graph Theory, Volume 108, Issue 4, Page 832-838, April 2025.ABSTRACT If L $L$ is a list assignment of r $r$ colors to each vertex of an n $n$‐vertex graph G $G$, then an equitable L $L$‐coloring of G $G$ is a proper coloring of vertices of G $G$ from their lists such that no color is used more than ⌈n/r⌉ $\lceil n/r\rceil $ times.
H. A. Kierstead +2 more
wiley +1 more source
Quantum automorphism groups of lexicographic products of graphs
Journal of the London Mathematical Society, Volume 111, Issue 4, April 2025.Abstract Sabidussi's theorem [Duke Math. J. 28 (1961), 573–578] gives necessary and sufficient conditions under which the automorphism group of a lexicographic product of two graphs is a wreath product of the respective automorphism groups. We prove a quantum version of Sabidussi's theorem for finite graphs, with the automorphism groups replaced by ...
Arnbjörg Soffía Árnadóttir +4 more
wiley +1 more source