Results 21 to 30 of about 25,369 (266)
Non symmetric random walk on infinite graph [PDF]
Opuscula Mathematica, 2011 We investigate properties of a non symmetric Markov's chain on an infinite graph. We show the connection with matrix valued random walk polynomials which satisfy the orthogonality formula with respect to non a symmetric matrix valued measure.
Marcin J. Zygmunt
doaj +1 more source
On the Metric Dimension of Infinite Graphs [PDF]
Electronic Notes in Discrete Mathematics, 2009 A set of vertices $S$ \emph{resolves} a graph $G$ if every vertex is uniquely determined by its vector of distances to the vertices in $S$. The \emph{metric dimension} of a graph $G$ is the minimum cardinality of a resolving set. In this paper we study the metric dimension of infinite graphs such that all its vertices have finite degree.
José Cáceres +4 more
openaire +5 more sources
The Dynamics of the Forest Graph Operator
Discussiones Mathematicae Graph Theory, 2016 In 1966, Cummins introduced the “tree graph”: the tree graph T(G) of a graph G (possibly infinite) has all its spanning trees as vertices, and distinct such trees correspond to adjacent vertices if they differ in just one edge, i.e., two spanning trees ...
Dara Suresh +4 more
doaj +1 more source
Sobolev Regularity of Multilinear Fractional Maximal Operators on Infinite Connected Graphs
Mathematics, 2021 Let G be an infinite connected graph. We introduce two kinds of multilinear fractional maximal operators on G. By assuming that the graph G satisfies certain geometric conditions, we establish the bounds for the above operators on the endpoint Sobolev ...
Suying Liu, Feng Liu
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 +2 more sources
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
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
Discrete Mathematics, 2011 It has recently been shown that infinite matroids can be axiomatized in a way that is very similar to finite matroids and permits duality. This was previously thought impossible, since finitary infinite matroids must have non-finitary duals. In this paper we illustrate the new theory by exhibiting its implications for the cycle and bond matroids of ...
Henning Bruhn, Reinhard Diestel
openaire +2 more sources