Results 31 to 40 of about 1,525,761 (361)
Norms, kernels and eigenvalues of some infinite graphs [PDF]
Operators and Matrices, 2018 In these paper we study the adjacency matrix of some infinite graphs, which we call the shift operator on the $L^p$ space of the graph. In particular, we establish norm estimates, we find the norm for some cases, we decide the triviality of the kernel of
Aahan Agrawal +4 more
semanticscholar +1 more source
A new class of graceful graphs: k-enriched fan graphs and their characterisations
Cubo, 2021 The Graceful Tree Conjecture stated by Rosa in the mid 1960s says that every tree can be gracefully labelled. It is one of the best known open problems in Graph Theory.
M. Haviar, S. Kurtulík
doaj +1 more source
Distinguishing infinite graphs with bounded degrees [PDF]
Journal of Graph Theory, 2018 Call a colouring of a graph distinguishing if the only colour preserving automorphism is the identity. A conjecture of Tucker states that if every automorphism of a connected graph G $G$ moves infinitely many vertices, then there is a distinguishing 2 ...
Florian Lehner +2 more
semanticscholar +1 more source
Bounds for Distinguishing Invariants of Infinite Graphs [PDF]
Electronic Journal of Combinatorics, 2017 We consider infinite graphs. The distinguishing number $D(G)$ of a graph $G$ is the minimum number of colours in a vertex colouring of $G$ that is preserved only by the trivial automorphism.
W. Imrich +3 more
semanticscholar +1 more source
A semidefinite programming hierarchy for packing problems in discrete geometry [PDF]
, 2014 Packing problems in discrete geometry can be modeled as finding independent sets in infinite graphs where one is interested in independent sets which are as large as possible. For finite graphs one popular way to compute upper bounds for the maximal size
de Laat, David, Vallentin, Frank
core +1 more source
Controllability of localised quantum states on infinite graphs through bilinear control fields [PDF]
International Journal of Control, 2018 In this work, we consider the bilinear Schrödinger equation (BSE) in the Hilbert space with an infinite graph. The Laplacian is equipped with self-adjoint boundary conditions, B is a bounded symmetric operator and with T>0. We study the well-posedness of
K. Ammari, Alessandro Duca
semanticscholar +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
Seidel Integral Complete Split Graphs [PDF]
Mathematics Interdisciplinary Research, 2019 In the paper we consider a generalized join operation, that is, the H-join on graphs where H is an arbitrary graph. In terms of Seidel matrix of graphs we determine the Seidel spectrum of the graphs obtained by this operation on regular graphs.
Pavel Hic +2 more
doaj +1 more source
Positive solutions of $p$-th Yamabe type equations on infinite graphs [PDF]
Proceedings of the American Mathematical Society, 2017 Let G = (V,E) be a connected infinite and locally finite weighted graph, ∆p be the p-th discrete graph Laplacian. In this paper, we consider the p-th Yamabe type equation −∆pu+ h|u| u = gu on G, where h and g are known, 2 < α ≤ p.
Xiaoxiao Zhang, Aijin Lin
semanticscholar +1 more source
Cycle density in infinite Ramanujan graphs [PDF]
, 2015 We introduce a technique using nonbacktracking random walk for estimating the spectral radius of simple random walk. This technique relates the density of nontrivial cycles in simple random walk to that in nonbacktracking random walk.
Lyons, Russell, Peres, Yuval
core +1 more source