Results 51 to 60 of about 278,889 (179)
Star complements in signed graphs with two symmetric eigenvalues
Kuwait Journal of Science, 2022 We consider signed graphs $G$ whose spectrum is comprised of exactly two (distinct) eigenvalues that differ only in sign, abbreviated to signed graphs with two symmetric eigenvalues. We obtain some relationships between such signed graphs and their star
Assoc. Prof, Zoran Stanić
doaj +1 more source
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
Cutsets in Infinite Graphs [PDF]
Combinatorics, Probability and Computing, 2006 We answer three questions posed in a paper by Babson and Benjamini. They introduced a parameter $C_G$ for Cayley graphs $G$ that has significant application to percolation. For a minimal cutset of $G$ and a partition of this cutset into two classes, take the minimal distance between the two classes.
openaire +2 more sources
The hyperbolicity constant of infinite circulant graphs
Open Mathematics, 2017 If X is a geodesic metric space and x1, x2, x3 ∈ X, a geodesic triangle T = {x1, x2, x3} is the union of the three geodesics [x1x2], [x2x3] and [x3x1] in X.
Rodríguez José M., Sigarreta José M.
doaj +1 more source
Spectral partitions on infinite graphs
, 2000 Statistical models on infinite graphs may exhibit inhomogeneous thermodynamic behaviour at macroscopic scales. This phenomenon is of geometrical origin and may be properly described in terms of spectral partitions into subgraphs with well defined ...
Alexander S +8 more
core +1 more source
Subshifts on Infinite Alphabets and Their Entropy
Entropy, 2020 We analyze symbolic dynamics to infinite alphabets by endowing the alphabet with the cofinite topology. The topological entropy is shown to be equal to the supremum of the growth rate of the complexity function with respect to finite subalphabets.
Sharwin Rezagholi
doaj +1 more source
Resolvent of Large Random Graphs
, 2009 We analyze the convergence of the spectrum of large random graphs to the spectrum of a limit infinite graph. We apply these results to graphs converging locally to trees and derive a new formula for the Stieljes transform of the spectral measure of such ...
Aldous +31 more
core +4 more sources
Reachability Analysis of Reversal-bounded Automata on Series-Parallel Graphs [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 Extensions to finite-state automata on strings, such as multi-head automata or multi-counter automata, have been successfully used to encode many infinite-state non-regular verification problems.
Rayna Dimitrova, Rupak Majumdar
doaj +1 more source
The rigidity of infinite graphs [PDF]
, 2013 A rigidity theory is developed for the Euclidean and non-Euclidean placements of countably infinite simple graphs in R^d with respect to the classical l^p norms, for d>1 and ...
Kitson, D., Power, S. C.
core
Unordered Love in infinite directed graphs
International Journal of Mathematics and Mathematical Sciences, 1992 A digraph D=(V,A) has the Unordered Love Property (ULP) if any two different vertices have a unique common outneighbor. If both (V,A) and (V,A−1) have the ULP, we say that D has the SDULP.
Peter D. Johnson
doaj +1 more source