let g = (v,e) be a locally finite graph, i.e. a graph in which every vertex has finitely many adjacent vertices. in this paper, we associate a topology to g, called graphic topology of g and we show that it is an alexandroff topology, i.e. a topology in which intersec- tion of every family of open sets is open. then we investigate some properties of this topology. our motivation is to give an e...

Let G = (V,E) be a locally finite graph, i.e. a graph in which every vertex has finitely many adjacent vertices. In this paper, we associate a topology to G, called graphic topology of G and we show that it is an Alexandroff topology, i.e. a topology in which intersec- tion of every family of open sets is open. Then we investigate some properties of this topology. Our motivation is to give an e...

We prove that a lamplighter graph of a locally finite graph over a finite graph does not admit a non-constant harmonic function of finite Dirichlet energy.

The topological approach to the study of infinite graphs of Diestel and K ̈hn has enabled several results on Hamilton cycles in finite graphs to be extended to locally finite graphs. We consider the result that the line graph of a finite 4-edge-connected graph is hamiltonian. We prove a weaker version of this result for infinite graphs: The line graph of locally finite, 6-edge-connected graph w...

this is a survey article on centralizers of finite‎ ‎subgroups in locally finite‎, ‎simple groups or lfs-groups as we‎ ‎will call them‎. ‎we mention some of the open problems about‎ ‎centralizers of subgroups in lfs-groups and applications of the‎ ‎known information about the centralizers of subgroups to the‎ ‎structure of the locally finite group‎. ‎we also prove the‎ ‎following‎: ‎let $g$ be...

A computable graph is computably categorical if any two computable presentations of the graph are computably isomorphic. In this paper we investigate the class of computably categorical graphs. We restrict ourselves to strongly locally finite graphs; these are the graphs all of whose components are finite. We present a necessary and sufficient condition for certain classes of strongly locally f...

In this paper we study the gradient estimate for positive solutions of Schrodinger equations on locally finite graph. Then we derive Harnack’s inequality for positive solutions of the Schrodinger equations. We also set up some results about Green functions of the Laplacian equation on locally finite graph. Interesting properties of Schrodinger equation are derived. Mathematics Subject Classific...