Results 31 to 40 of about 886,685 (323)
Discussiones Mathematicae Graph Theory, 2013 The infimum of the least eigenvalues of all finite induced subgraphs of an infinite graph is defined to be its least eigenvalue. In [P.J. Cameron, J.M. Goethals, J.J. Seidel and E.E. Shult, Line graphs, root systems, and elliptic geometry, J. Algebra 43 (
Vijayakumar Gurusamy Rengasamy
doaj +1 more source
Graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set [PDF]
Opuscula MathematicaA graph \(G\) whose vertex set can be partitioned into a total dominating set and an independent dominating set is called a TI-graph. We give constructions that yield infinite families of graphs that are TI-graphs, as well as constructions that yield ...
Teresa W. Haynes, Michael A. Henning
doaj +1 more source
Alexandria Engineering Journal, 2022 Graph theory is a powerful and essential tool for applied scientists and engineers in analyzing and designing algorithms for several problems. Graph theory has a vital role in complex systems, especially in computer sciences. Applications of graph theory
A. El-Mesady +2 more
doaj +1 more source
The Colouring Number of Infinite Graphs [PDF]
Combinatorica, 2019 We show that, given an infinite cardinal $μ$, a graph has colouring number at most $μ$ if and only if it contains neither of two types of subgraph. We also show that every graph with infinite colouring number has a well-ordering of its vertices that simultaneously witnesses its colouring number and its cardinality.
Nathan J. Bowler +3 more
openaire +3 more sources
Context-Sensitive Languages, Rational Graphs and Determinism [PDF]
Logical Methods in Computer Science, 2006 We investigate families of infinite automata for context-sensitive languages. An infinite automaton is an infinite labeled graph with two sets of initial and final vertices.
Arnaud Carayol, Antoine Meyer
doaj +1 more source
A Framework for Rewriting Families of String Diagrams [PDF]
Electronic Proceedings in Theoretical Computer Science, 2019 We describe a mathematical framework for equational reasoning about infinite families of string diagrams which is amenable to computer automation. The framework is based on context-free families of string diagrams which we represent using context-free ...
Vladimir Zamdzhiev
doaj +1 more source
Unicorn paths and hyperfiniteness for the mapping class group
Forum of Mathematics, Sigma, 2021 Let S be an orientable surface of finite type. Using Pho-on’s infinite unicorn paths, we prove the hyperfiniteness of orbit equivalence relations induced by the actions of the mapping class group of S on the Gromov boundaries of the arc graph and the ...
Piotr Przytycki, Marcin Sabok
doaj +1 more source
The Distinguishing Index of Infinite Graphs [PDF]
The Electronic Journal of Combinatorics, 2015 The distinguishing index $D^\prime(G)$ of a graph $G$ is the least cardinal $d$ such that $G$ has an edge colouring with $d$ colours that is only preserved by the trivial automorphism. This is similar to the notion of the distinguishing number $D(G)$ of a graph $G$, which is defined with respect to vertex colourings.We derive several bounds for ...
Broere, Izak, Pilsniak, Monika
openaire +2 more sources
Journal of Mathematics, 2021 This work deals with the well-known group-theoretic graphs called coset graphs for the modular group G and its applications. The group action of G on real quadratic fields forms infinite coset graphs. These graphs are made up of closed paths. When M acts
Hanan Alolaiyan +3 more
doaj +1 more source
Convolution operators and the discrete Laplacian [PDF]
, 2009 PhDIn this thesis, we obtain new results for convolution operators on homogeneous spaces and give applications to the Laplacian on a homogeneous graph. Some of these results have been published in joint papers [13, 14] with my supervisor.
Chen, Chung-Chuan
core +4 more sources