Related papers: Uniqueness of exterior differentiation on locally …

A graph is called uniquely distinguishing colorable if there is only one partition of vertices of the graph that forms distinguishing coloring with the smallest possible colors. In this paper, we study the unique colorability of the…

We show that the strong odd chromatic number on any proper minor-closed graph class is bounded by a constant. We almost determine the smallest such constant for outerplanar graphs.

In this paper, we study the higher Steklov eigenvalues of graphs on surfaces. We obtain the upper bound of higher Steklov eigenvalues of a finite graph $G$ with boundary $B$ and genus $g$ by using metrical deformation via probability flows.…

In our previous paper [International Journal of Theoretical Physics, 41 (2002), 1165-1190] we have shown, following the tradition of synthetic differential geometry, that div and rot are uniquely determined, so long as we require that the…

Using topological circles in the Freudenthal compactification of a graph as infinite cycles, we extend to locally finite graphs a result of Oberly and Sumner on the Hamiltonicity of finite graphs. This answers a question of Stein, and gives…

A proper vertex-colouring of a graph G is said to be locally identifying if for any pair u,v of adjacent vertices with distinct closed neighbourhoods, the sets of colours in the closed neighbourhoods of u and v are different. We show that…

We describe and prove uniqueness of a natural homomorphism between some groups associated to finite sets.

This manuscript introduces Diophantine labeling, a new way of labeling of the vertices for finite simple undirected graphs with some divisibility condition on the edges. Maximal graphs admitting Diophantine labeling are investigated and…

The extremal eigenvalues including maximum eigenvalues and the minimum eigenvalues about outerplanar graphs are investigated in this paper. Some structural characterizations about the (edge) maximal bipartite outerplanar graphs are…

In this note, we give short inductive proofs of two known results on $k$-extendible graphs based on a property proved in [Qinglin Yu, A note on $n$-extendable graphs. Journal of Graph Theory, 16:349-353, 1992].

We present simple graph-theoretic characterizations of Cayley graphs for left-cancellative monoids, groups, left-quasigroups and quasigroups. We show that these characterizations are effective for the end-regular graphs of finite degree.

We provide two constructions for $t$ edge-disjoint maximal outerplanar graphs on every number of $n \geq 4t$ vertices. The bound on the minimum number of vertices is tight. These constructions yield the existence of optimal…

We present a canonical way to decompose finite graphs into highly connected local parts. The decomposition depends only on an integer parameter whose choice sets the intended degree of locality. The global structure of the graph, as…

A criterion is established for the transitivity of connectedness in a transfinite graph. Its proof is much shorter than a prior argument published previously for that criterion.

Let $\Gamma$ be a graph equipped with a Markov operator $P$. We introduce discrete fractional Littlewood-Paley square functionals and prove their $L^p$-boundedness under various geometric assumptions on $\Gamma$.

In this paper, we prove the uniqueness of certain Fourier-Jacobi models for the split exceptional group $G_2$ over finite fields with odd characteristic. Similar results are also proved for $Sp_4$ and $U_4$.

This paper is devoted to the investigation of the spectral theory and dynamical properties of periodic graphs which are not locally finite but carry non-negative, symmetric and summable edge weights. These graphs are shown to exhibit rather…

We establish a Harnack inequality for finite connected graphs with non-negative Ricci curvature. As a consequence, we derive an eigenvalue lower bound, extending previous results for Ricci flat graphs.

We prove \emph{global} uniqueness for an inverse problem for the fractional conductivity equation on domains that are bounded in one direction. The conductivities are assumed to be isotropic and nontrivial in the exterior of the domain,…

We supply an upper bound on the distinguishing chromatic number of certain infinite graphs satisfying an adjacency property. Distinguishing proper $n$-colourings are generalized to the new notion of distinguishing homomorphisms. We prove…