Add to ORKGSummary. First, we introduce the concept of adjacency for a pair of natural numbers. Second, we extend the concept for two pairs of natural numbers. The pairs represent points of a lattice in a plane. We show that if some property is infectious among adjacent points, and some points have the property, then all points have the property. MML Identifier: GOBRD10
The adjacency matrix of a graph shows how the vertices are connected; when the entry at row i, colum...
AbstractVizing's adjacency lemma describes an important property of edge-chromatic critical graphs. ...
AbstractFor which adjacency relations (i.e., irreflexive symmetric binary relations) α on Zn does th...
Summary. First, we introduce the concept of adjacency for a pair of natural numbers. Second, we exte...
There are typically several nonisomorphic graphs having a given degree sequence, and for any two deg...
AbstractIn edge colouring it is often useful to have information about the degree distribution of th...
Adjacency trees can model the nesting structure of spatial regions. In many applications it is neces...
A graph is said to have property P1,n if for every sequence of n + 1 points, there is another point ...
Abstract. The distinguishing number of countably infinite graphs and relational struc-tures satisfyi...
Our main theoretical result is that, if a simple polytope has a pair of complementary vertices (i.e....
AbstractA graph is said to have property P1,n if for every sequence of n + 1 points, there is anothe...
AbstractAdjacency trees can model the nesting structure of spatial regions. In many applications it ...
AbstractThe notion of visible point in a lattice is extended to the notion of visible pair of points...
We analyze, in general terms, the evolution of energy levels in quantum mechanics, as a function of ...
Adjacency structures as mappings between function and structure in discrete static system
The adjacency matrix of a graph shows how the vertices are connected; when the entry at row i, colum...
AbstractVizing's adjacency lemma describes an important property of edge-chromatic critical graphs. ...
AbstractFor which adjacency relations (i.e., irreflexive symmetric binary relations) α on Zn does th...
Summary. First, we introduce the concept of adjacency for a pair of natural numbers. Second, we exte...
There are typically several nonisomorphic graphs having a given degree sequence, and for any two deg...
AbstractIn edge colouring it is often useful to have information about the degree distribution of th...
Adjacency trees can model the nesting structure of spatial regions. In many applications it is neces...
A graph is said to have property P1,n if for every sequence of n + 1 points, there is another point ...
Abstract. The distinguishing number of countably infinite graphs and relational struc-tures satisfyi...
Our main theoretical result is that, if a simple polytope has a pair of complementary vertices (i.e....
AbstractA graph is said to have property P1,n if for every sequence of n + 1 points, there is anothe...
AbstractAdjacency trees can model the nesting structure of spatial regions. In many applications it ...
AbstractThe notion of visible point in a lattice is extended to the notion of visible pair of points...
We analyze, in general terms, the evolution of energy levels in quantum mechanics, as a function of ...
Adjacency structures as mappings between function and structure in discrete static system
The adjacency matrix of a graph shows how the vertices are connected; when the entry at row i, colum...
AbstractVizing's adjacency lemma describes an important property of edge-chromatic critical graphs. ...
AbstractFor which adjacency relations (i.e., irreflexive symmetric binary relations) α on Zn does th...