Advances in Discrete Applied Mathematics and Graph Theory

The present reprint contains twelve papers published in the Special Issue “Advances in Discrete Applied Mathematics and Graph Theory, 2021” of the MDPI Mathematics journal, which cover a wide range of topics connected to the theory and applications of Graph Theory and Discrete Applied Mathematics. The focus of the majority of papers is on recent advances in graph theory and applications in chemical graph theory. In particular, the topics studied include bipartite and multipartite Ramsey numbers, graph coloring and chromatic numbers, several varieties of domination (Double Roman, Quasi-Total Roman, Total 3-Roman) and two graph indices of interest in chemical graph theory (Sombor index, generalized ABC index), as well as hyperspaces of graphs and local inclusive distance vertex irregular graphs

Rotulações graciosas e rotulações semifortes em grafos

Orientador: Christiane Neme CamposTese (doutorado) - Universidade Estadual de Campinas, Instituto de ComputaçãoResumo: Três problemas de rotulação em grafos são investigados nesta tese: a Conjetura das Árvores Graciosas, a Conjetura 1,2,3 e a Conjetura 1,2. Uma rotulação graciosa de um grafo simples G=(V(G),E(G)) é uma função injetora f de V(G) em {0,...,|E(G)|} tal que {|f(u)-f(v)|: uv em E(G)} = {1,...,|E(G)|}. A Conjetura das Árvores Graciosas, proposta por Rosa e Kotzig em 1967, afirma que toda árvore possui uma rotulação graciosa. Um problema relacionado à Conjetura das Árvores Graciosas consiste em determinar se, para todo vértice v de uma árvore T, existe uma rotulação graciosa de T que atribui o rótulo 0 a v. Árvores com tal propriedade são denominadas 0-rotativas. Nesta tese, apresentamos famílias infinitas de caterpillars 0-rotativos. Nossos resultados reforçam a conjetura de que todo caterpillar com diâmetro pelo menos cinco é 0-rotativo. Também investigamos uma rotulação graciosa mais restrita, chamada rotulação-alpha. Uma rotulação graciosa f de G é uma rotulação-alpha se existir um inteiro k, 0 <= k <= |E(G)|, tal que, para toda aresta uv em E(G), f(u) <= k < f(v) ou f(v) <= k < f(u). Nesta tese, apresentamos duas famílias de lobsters com grau máximo três que possuem rotulações-alpha. Nossos resultados contribuem para uma caracterização de todos os lobsters com grau máximo três que possuem rotulações-alpha. Na segunda parte desta tese, investigamos generalizações da Conjetura 1,2,3 e da Conjetura 1,2. Dado um grafo simples G = (V(G),E(G)) e um subconjunto L dos números reais, dizemos que uma função f de E(G) em L é uma L-rotulação de arestas de G e dizemos que uma função f da união de V(G) com E(G) em L é uma L-rotulação total de G. Para todo vértice v de G, a cor de v, C(v), é definida como a soma dos rótulos das arestas incidentes em v, se f for uma L-rotulação de arestas de G. Se f for uma L-rotulação total, C(v) é a soma dos rótulos das arestas incidentes no vértice v mais o valor f(v). O par (f,C) é uma L-rotulação de arestas semiforte (L-rotulação total semiforte) se f for uma rotulação de arestas (rotulação total) e C(u) for diferente de C(v) para quaisquer dois vértices adjacentes u,v de G. A Conjetura 1,2,3, proposta por Karónski et al. em 2004, afirma que todo grafo simples e conexo com pelo menos três vértices possui uma {1,2,3}-rotulação de arestas semiforte. A Conjetura 1,2, proposta por Przybylo e Wozniak em 2010, afirma que todo grafo simples possui uma {1,2}-rotulação total semiforte. Sejam a,b,c três reais distintos. Nesta tese, nós investigamos {a,b,c}-rotulações de arestas semifortes e {a,b}-rotulações totais semifortes para cinco famílias de grafos: as potências de caminho, as potências de ciclo, os grafos split, os grafos cobipartidos regulares e os grafos multipartidos completos. Provamos que essas famílias possuem tais rotulações para alguns valores reais a,b,c. Como corolário de nossos resultados, obtemos que a Conjetura 1,2,3 e a Conjetura 1,2 são verdadeiras para essas famílias. Além disso, também mostramos que nossos resultados em rotulações de arestas semifortes implicam resultados similares para outro problema de rotulação de arestas relacionadoAbstract: This thesis addresses three labelling problems on graphs: the Graceful Tree Conjecture, the 1,2,3-Conjecture, and the 1,2-Conjecture. A graceful labelling of a simple graph G=(V(G),E(G)) is an injective function f from V(G) to {0,...,|E(G)|} such that {|f(u)-f(v)| : uv in E(G)} = {1,...,|E(G)|}. The Graceful Tree Conjecture, posed by Rosa and Kotzig in 1967, states that every tree has a graceful labelling. A problem connected with the Graceful Tree Conjecture consists of determining whether, for every vertex v of a tree T, there exists a graceful labelling of T that assigns label 0 to v. Trees with such a property are called 0-rotatable. In this thesis, we present infinite families of 0-rotatable caterpillars. Our results reinforce a conjecture that states that every caterpillar with diameter at least five is 0-rotatable. We also investigate a stronger type of graceful labelling, called alpha-labelling. A graceful labelling f of G is an alpha-labelling if there exists an integer k with 0<= k <= |E(G)| such that, for each edge uv in E(G), either f(u) <= k < f(v) or f(v) <= k < f(u). In this thesis, we prove that the following families of lobsters have alpha-labellings: lobsters with maximum degree three, without Y-legs and with at most one forbidden ending; and lobsters T with a perfect matching M such that the contracted tree T/M has a balanced bipartition. These results point towards a characterization of all lobsters with maximum degree three that have alpha-labellings. In the second part of the thesis, we focus on generalizations of the 1,2,3-Conjecture and the 1,2-Conjecture. Given a simple graph G=(V(G),E(G)) and a subset L of real numbers, we call a function f from E(G) to L an L-edge-labelling of G, and we call a function f from V(G) union E(G) to L an L-total-labelling of G. For each vertex v of G, the colour of v, C(v), is defined as the sum of the labels of its incident edges, if f is an L-edge-labelling. If f is an L-total-labelling, C(v) is the sum of the labels of the edges incident with vertex v plus the label f(v). The pair (f,C) is a neighbour-distinguishing L-edge-labelling (neighbour-distinguishing L-total-labelling) if f is an edge-labelling (total-labelling) and C(u) is different from C(v), for every edge uv in E(G). The 1,2,3-Conjecture, posed by Kar\'onski et al. in 2004, states that every connected simple graph with at least three vertices has a neighbour-distinguishing {1,2,3}-edge-labelling. The 1,2-Conjecture, posed by Przybylo and Wozniak in 2010, states that every simple graph has a neighbour-distinguishing {1,2}-total-labelling. Let a,b,c be distinct real numbers. In this thesis, we investigate neighbour-distinguishing {a,b,c}-edge-labellings and neighbour-distinguishing {a,b}-total labellings for five families of graphs: powers of paths, powers of cycles, split graphs, regular cobipartite graphs and complete multipartite graphs. We prove that these families have such labellings for some real values a, b, and c. As a corollary of our results, we obtain that the 1,2,3-Conjecture and the 1,2-Conjecture are true for these families. Furthermore, we also show that our results on neighbour-distinguishing edge-labellings imply similar results on a closely related problem called detectable edge-labelling of graphsDoutoradoCiência da ComputaçãoDoutor em Ciência da Computação2014/16861-8FAPESPCAPE

From Physics to Number Theory via Noncommutative Geometry, Part II: Renormalization, the Riemann-Hilbert correspondence, and motivic Galois theory

We establish a precise relation between Galois theory in its motivic form with the mathematical theory of perturbative renormalization (in the minimal subtraction scheme with dimensional regularization). We identify, through a Riemann-Hilbert correspondence based on the Birkhoff decomposition and the t'Hooft relations, a universal symmetry group (the "cosmic Galois group" suggested by Cartier), which contains the renormalization group and acts on the set of physical theories. This group is closely related to motivic Galois theory. We construct a universal singular frame of geometric nature, in which all divergences disappear. The paper includes a detailed overview of the work of Connes-Kreimer and background material on the main quantum field theoretic and algebro-geometric notions involved. We give a complete account of our results announced in math.NT/0409306.Comment: 97 pages LaTeX, 17 eps figure

Evolutionary games on graphs

Game theory is one of the key paradigms behind many scientific disciplines from biology to behavioral sciences to economics. In its evolutionary form and especially when the interacting agents are linked in a specific social network the underlying solution concepts and methods are very similar to those applied in non-equilibrium statistical physics. This review gives a tutorial-type overview of the field for physicists. The first three sections introduce the necessary background in classical and evolutionary game theory from the basic definitions to the most important results. The fourth section surveys the topological complications implied by non-mean-field-type social network structures in general. The last three sections discuss in detail the dynamic behavior of three prominent classes of models: the Prisoner's Dilemma, the Rock-Scissors-Paper game, and Competing Associations. The major theme of the review is in what sense and how the graph structure of interactions can modify and enrich the picture of long term behavioral patterns emerging in evolutionary games.Comment: Review, final version, 133 pages, 65 figure

Modeling of Masonry Structures at Multiple Scales

Zdivo je materiál použitý ve většině stavebních památek na celém světě. Spolehlivé nástroje pro analýzu zděných konstrukcí jsou zapotřebí nejen pro vyhodnocení jejich seismické zranitelnosti, ale také při návrhu opatření směřujících k obnovení či zvýšení únosnosti existujících budov, které si zaslouží ochranu. Zdivo je nelineární, heterogenní a anizotropní materiál, jehož vlastnosti silně závisejí na základních stavebních jednotkách, tedy blocích (cihlách) a maltě, a na jejich prostorovém uspořádání. Pro simulaci mechanického chování zděných konstrukcí byla vyvinuta řada modelů, které se liší mírou rozlišení. Pro velké konstrukce vede snaha o výpočetní efektivitu ke zjednodušeným modelům, charakterizovaným rozdělením zděných stěn na makroprvky. Významným zástupcem této skupiny modelů je metoda ekvivalentního rámu. Její podstatou je nahrazení zděné stěny idealizovaným rámem, přičemž panely jsou modelovány jako nosníky charakterizované odpovídajícím mechanickým chováním. Míra rozlišení může být zvýšena tím, že se každý makroprvek uvažuje jako homogenizované kontinuum s vlastnostmi, které reprodukují celkovou odezvu určitého výseku heterogenní mikrostruktury. Formulace vhodného konstitutivního zákona ale není lehkou úlohou. Tento zákon by měl fenomenologicky reprodukovat mechanické chování materiálu, včetně vzniku tahových trhlin, smykového pokluzu, drcení v tlaku a dalších jevů. Navíc tento přístup vyžaduje těžkopádnou identifikaci mechanických parametrů, které není vždy snadné určit na základě běžných laboratorních testů materiálu. K popisu role základních stavebních jednotek a jejich interakce může posloužit model formulovaný na mikroúrovni, který explicitně bere v úvahu jednotlivé bloky, maltu a rozhraní mezi nimi. Tato práce se zabývá zděnými konstrukcemi na několika úrovních rozlišení. Problémy s formulací modelů ekvivalentního rámu v případě nepravidelného rozmístění otvorů se zkoumají na základě porovnání výsledků pro ekvivalentní rámy s výsledky získanými metodou konečných prvků, o které lze předpokládat, že lépe postihuje skutečné chování nepravidelných stěn. Provedená parametrická analýza zděných pilířů modelovaných jako homogenizované kontinuum je zaměřena na posouzení vlivu tvaru a svislého tlakového zatížení na nelineární statické chování. Pozornost se pak přesouvá na jemnější úrovně rozlišení, na nichž se zkoumá lokalizace nepružného přetváření, která ovlivňuje konstitutivní zákony pro modelování zdiva na makro a mikroúrovni. Provádí se lokalizační analýza ortotropního makroskopického modelu formulovaného podle teorie plasticity s více plochami plasticity, v jejímž rámci jsou odvozeny analytické podmínky lokalizace potvrzené simulacemi metodou konečných prvků. V závěru je vyvinut mikromechanický model pro pravidelné zdivo a pomocí něj se na reprezentativním objemu materiálu analyzují lokalizační vlastnosti, ovlivněné velikostí tohoto objemu a předpokládanými směry periodicityMasonry represents the material used in the great majority of the world building heritage structures. Reliable tools for analysis of masonry structures are needed not only for seismic vulnerability assessment but also to properly design interventions to restore and strengthen existing buildings, which deserve to be preserved. Masonry is a nonlinear, heterogeneous, and anisotropic material whose properties strongly depend on its microstructure, typically composed of two phases, blocks and mortar, and on the way it is assembled. To simulate the mechanical behavior of masonry structures, numerous models have been developed, characterized by different detailing levels. For large structures, the need for computational efficiency leads to simplified models characterized by the subdivision of masonry walls in macro-elements. A notable example of this group of models is the equivalent-frame method, which consists of identifying the masonry wall with an ideal frame, where panels are modeled as beams characterized by proper mechanical behavior. The detailing level can be increased by considering each macro-element as a homogenized continuum, assuming that, at the scale of representation, masonry can be treated as a continuum having mechanical properties that reproduce the overall response of a certain portion of the heterogeneous microstructure. However, the formulation of a suitable constitutive law is not an easy task. It should phenomenologically reproduce the material mechanics, including tension cracking, shear sliding, compressive crushing, and many other aspects. Moreover, this approach requires a cumbersome identification of mechanical parameters that are not always easy to determine from basic experimental tests on the material. To consider the role of each constituent and the effects of their interactions, a microscale model can be set up, where blocks, mortar joints, and mortar-block interfaces are represented explicitly. In this work, masonry structures are studied at several detailing levels. An issue affecting equivalent-frame models, namely the presence of irregularity in the wall opening layout, is addressed by comparing equivalent-frame results with finite-element ones, which are assumed to better represent the actual behavior of irregular walls. A parametric analysis on masonry piers, modeled as a homogenized continuum, is carried out, aimed to assess the influence of the height-to-width ratio and the vertical compression load on the nonlinear static behavior. The focus is then shifted to finer scales. The localization analysis of an orthotropic macro-scale model in the framework of multi-surface plasticity is presented, deriving analytical localization conditions corroborated by finite element simulations. Finally, a microscale model for regular masonry is developed to analyze the localization properties of the representative volume element, also by investigating the role of its size and periodicity directions

From spline wavelet to sampling theory on circulant graphs and beyond– conceiving sparsity in graph signal processing

Graph Signal Processing (GSP), as the field concerned with the extension of classical signal processing concepts to the graph domain, is still at the beginning on the path toward providing a generalized theory of signal processing. As such, this thesis aspires to conceive the theory of sparse representations on graphs by traversing the cornerstones of wavelet and sampling theory on graphs. Beginning with the novel topic of graph spline wavelet theory, we introduce families of spline and e-spline wavelets, and associated filterbanks on circulant graphs, which lever- age an inherent vanishing moment property of circulant graph Laplacian matrices (and their parameterized generalizations), for the reproduction and annihilation of (exponen- tial) polynomial signals. Further, these families are shown to provide a stepping stone to generalized graph wavelet designs with adaptive (annihilation) properties. Circulant graphs, which serve as building blocks, facilitate intuitively equivalent signal processing concepts and operations, such that insights can be leveraged for and extended to more complex scenarios, including arbitrary undirected graphs, time-varying graphs, as well as associated signals with space- and time-variant properties, all the while retaining the focus on inducing sparse representations. Further, we shift from sparsity-inducing to sparsity-leveraging theory and present a novel sampling and graph coarsening framework for (wavelet-)sparse graph signals, inspired by Finite Rate of Innovation (FRI) theory and directly building upon (graph) spline wavelet theory. At its core, the introduced Graph-FRI-framework states that any K-sparse signal residing on the vertices of a circulant graph can be sampled and perfectly reconstructed from its dimensionality-reduced graph spectral representation of minimum size 2K, while the structure of an associated coarsened graph is simultaneously inferred. Extensions to arbitrary graphs can be enforced via suitable approximation schemes. Eventually, gained insights are unified in a graph-based image approximation framework which further leverages graph partitioning and re-labelling techniques for a maximally sparse graph wavelet representation.Open Acces

Rooted structures in graphs: a project on Hadwiger's conjecture, rooted minors, and Tutte cycles

Hadwigers Vermutung ist eine der anspruchsvollsten Vermutungen für Graphentheoretiker und bietet eine weitreichende Verallgemeinerung des Vierfarbensatzes. Ausgehend von dieser offenen Frage der strukturellen Graphentheorie werden gewurzelte Strukturen in Graphen diskutiert. Eine Transversale einer Partition ist definiert als eine Menge, welche genau ein Element aus jeder Menge der Partition enthält und sonst nichts. Für einen Graphen G und eine Teilmenge T seiner Knotenmenge ist ein gewurzelter Minor von G ein Minor, der T als Transversale seiner Taschen enthält. Sei T eine Transversale einer Färbung eines Graphen, sodass es ein System von kanten-disjunkten Wegen zwischen allen Knoten aus T gibt; dann stellt sich die Frage, ob es möglich ist, die Existenz eines vollständigen, in T gewurzelten Minors zu gewährleisten. Diese Frage ist eng mit Hadwigers Vermutung verwoben: Eine positive Antwort würde Hadwigers Vermutung für eindeutig färbbare Graphen bestätigen. In dieser Arbeit wird ebendiese Fragestellung untersucht sowie weitere Konzepte vorgestellt, welche bekannte Ideen der strukturellen Graphentheorie um eine Verwurzelung erweitern. Beispielsweise wird diskutiert, inwiefern hoch zusammenhängende Teilmengen der Knotenmenge einen hoch zusammenhängenden, gewurzelten Minor erzwingen. Zudem werden verschiedene Ideen von Hamiltonizität in planaren und nicht-planaren Graphen behandelt.Hadwiger's Conjecture is one of the most tantalising conjectures for graph theorists and offers a far-reaching generalisation of the Four-Colour-Theorem. Based on this major issue in structural graph theory, this thesis explores rooted structures in graphs. A transversal of a partition is a set which contains exactly one element from each member of the partition and nothing else. Given a graph G and a subset T of its vertex set, a rooted minor of G is a minor such that T is a transversal of its branch set. Assume that a graph has a transversal T of one of its colourings such that there is a system of edge-disjoint paths between all vertices from T; it comes natural to ask whether such graphs contain a minor rooted at T. This question of containment is strongly related to Hadwiger's Conjecture; indeed, a positive answer would prove Hadwiger's Conjecture for uniquely colourable graphs. This thesis studies the aforementioned question and besides, presents several other concepts of attaching rooted relatedness to ideas in structural graph theory. For instance, whether a highly connected subset of the vertex set forces a highly connected rooted minor. Moreover, several ideas of Hamiltonicity in planar and non-planar graphs are discussed