Related papers: Region crossing change on planar trivalent graphs
We introduce the concept of NIC-planar graphs and present the full characterization of NIC-planar complete k-partite graphs.
We give a brief overview of the theoretical status of the Transition Distribution Amplitudes and discuss their experimental near future.
We revisit the problem of hard particles on planar random tetravalent graphs in view of recent combinatorial techniques relating planar diagrams to decorated trees. We show how to recover the two-matrix model solution to this problem in…
We study the phenomenological implications of breaking the Tri-Bimaximal (TBM) mixing in such a way that either first or second column of TBM mixing matrix remains invariant. We present two such textures and confront them with the…
In this paper, we study Dehn colorings for spatial graphs, and give a family of spatial graph invariants that are called vertex-weight invariants. We give some examples of spatial graphs that can be distinguished by a vertex-weight…
A good deal of research has been done and published on coloring of the vertices of graphs for several years while studying of the excellent work of those maestros, we get inspire to work on the vertex coloring of graphs in case of a…
In this paper, we mainly investigate distortion and covering theorems on some classes of pluriharmonic mappings.
We explore various techniques for counting the number of straight-edge crossing-free graphs that can be embedded on a planar point set. In particular, we derive a lower bound on the ratio of the number of such graphs with $m+1$ edges to the…
A tanglegram consists of two rooted binary trees and a perfect matching between their leaves, and a planar tanglegram is one that admits a layout with no crossings. We show that the problem of generating planar tanglegrams uniformly at…
Starting from context-free inverse graphs, we introduce a new class of groups and study their structural properties. We establish closure properties, show that their co-word problems are context-free, analyze torsion elements, and realize…
In this paper, with the help of trinomial coefficients we study some arithmetic properties of certain determiants involving reciprocals of binary quadratic forms over finite fields.
With the advancements in technology and monitoring tools, we often encounter multivariate graph signals, which can be seen as the realizations of multivariate graph processes, and revealing the relationship between their constituent…
In the paper we present simple examples of linear random fields defined on $\ZZ^2$ and $\ZZ^3$ which exhibit the scaling transition phenomenon. These examples lead to more general definition of the scaling transition and allow to understand…
A broader definition of generalized truncations of graphs is introduced followed by an exploration of some standard concepts and parameters with regard to generalized truncations.
The response function of graphene is calculated in the presence of a constant current across the sample. For small drift velocities and finite chemical potential, analytic expressions are obtained and consequences on the plasmonic…
Given a surface with boundary and some points on its boundary, a polygon diagram is a way to connect those points as vertices of non-overlapping polygons on the surface. Such polygon diagrams represent non-crossing permutations on a surface…
Unlike classical bifurcations, border-collision bifurcations occur when, for example, a fixed point of a continuous, piecewise $\mathcal{C}^{1}$ map crosses a boundary in state space. Although classical bifurcations have been much studied,…
In an article, E. Grafarend and B. Schaffrin studied the geometry of non-linear adjustment of the planar trisection problem using the Gauss Markov model and the method of the least squares. This paper develops the same method working on an…
Chord diagrams on circles and their intersection graphs (also known as circle graphs) have been intensively studied, and have many applications to the study of knots and knot invariants, among others. However, chord diagrams on more general…
Beyond-planarity focuses on the study of geometric and topological graphs that are in some sense nearly-planar. Here, planarity is relaxed by allowing edge crossings, but only with respect to some local forbidden crossing configurations.…