Related papers: Capacity of infinite graphs over non-Archimedean o…
We investigate structural implications arising from the condition that a given directed graph does not interpret, in the sense of primitive positive interpretation with parameters or orbits, every finite structure. Our results generalize…
We investigate the multiplicity of solutions for a generalized poly-Laplacian system on weighted finite graphs and a generalized poly-Laplacian system with Dirichlet boundary value on weighted locally finite graphs, respectively, via the…
Let $G$ be a group. The \emph{power graph} of $G$ is a graph with the vertex set $G$, having an edge between two elements whenever one is a power of the other. We characterize nilpotent groups whose power graphs have finite independence…
We calculate effective impedances of infinite $LC$- and $CL$- ladder networks as limits of effective impedances of finite network approximations, using a new method, which involves precise mathematical concepts. These concepts are related…
We explore positivity properties of the semigroup generated by the negative of the Dirichlet-to-Neumann operator with real potential $\lambda$, defined on a subset of the vertices of a quantum graph. We show that for rationally independent…
We investigate properties which ensure that a given finite graph is the commuting graph of a group or semigroup. We show that all graphs on at least two vertices such that no vertex is adjacent to all other vertices is the commuting graph…
In this paper, we deal with a notion of Banach space-valued mappings defined on a set consisting of finite graphs with uniformly bounded vertex degree. These functions will be endowed with certain boundedness and additivity criteria. We…
It is well-known that in finite graphs, large complete minors/topological minors can be forced by assuming a large average degree. Our aim is to extend this fact to infinite graphs. For this, we generalise the notion of the relative end…
We consider bounds on maximum nullity of a graph via transversal numbers of compatible collections of forts. Results include generalizations of theorems from symmetric to combinatorially symmetric matrices, special bases of matrix…
In this thesis we consider ordered graphs (that is, graphs with a fixed linear ordering on their vertices). We summarize and further investigations on the number of edges an ordered graph may have while avoiding a fixed forbidden ordered…
We study inhomogeneous random graphs with a finite type space. For a natural generalization of the model as a dynamic network-valued process, the paper establishes the following results: (a) Functional central limit theorems for the…
We interpret realizations of a graph on the sphere up to rotations as elements of a moduli space of curves of genus zero. We focus on those graphs that admit an assignment of edge lengths on the sphere resulting in a flexible object. Our…
This paper delves into three research directions, leveraging the Lov\'{a}sz $\vartheta$-function of a graph. First, it focuses on the Shannon capacity of graphs, providing new results that determine the capacity for two infinite subclasses…
We apply model theoretic methods to the problem of existence of countable universal graphs with finitely many forbidden connected subgraphs. We show that to a large extent the question reduces to one of local finiteness of an…
In this letter we study the NP-complete vertex cover problem on finite connectivity random graphs. When the allowed size of the cover set is decreased, a discontinuous transition in solvability and typical-case complexity occurs. This…
The presented material continues the previous article (arxiv:1007.1059) and also is devoted to the equivalent conversion between the graphs. The examining of the transformation of the vertex graphs into the edge graphs (together with the…
We study semilinear elliptic inequalities with a potential on infinite graphs. Given a distance on the graph, we assume an upper bound on its Laplacian, and a growth condition on a suitable weighted volume of balls. Under such hypotheses,…
Necessary and sufficient conditions for a finite connected graph with a strict partial order on vertices to be a combinatorial invariant of pseudoharmonic function are obtained.
We study the graph energy from a cooperative game viewpoint. We introduce \emph{the graph energy game} and show various properties. In particular, we see that it is a superadditive game and that the energy of a vertex, as defined in…
We compare three transitivity properties of finite graphs, namely, for a positive integer $s$, $s$-distance transitivity, $s$-geodesic transitivity and $s$-arc transitivity. It is known that if a finite graph is $s$-arc transitive but not…