Related papers: Quadratic embedding constants of path graphs
This paper develops a structural theory of unique shortest paths in real-weighted graphs. Our main goal is to characterize exactly which sets of node sequences, which we call path systems, can be realized as unique shortest paths in a graph…
A new family of strongly regular graphs, called the general symplectic graphs $Sp(2\nu, q)$, associated with nonsingular alternate matrices is introduced. Their parameters as strongly regular graphs, their chromatic numbers as well as their…
This paper introduces and demonstrates a computational pipeline for the statistical analysis of shape graph datasets, namely geometric networks embedded in 2D or 3D spaces. Unlike traditional abstract graphs, our purpose is not only to…
In this study, after introducing algebraic properties of real quaternions some characterizations of quaternionic involute-evolute curves in Q are obtained. And some results and theorems for quaternionic w-curves are given. Lastly, we…
Several graph properties are characterized as the class of graphs that admit an orientation avoiding finitely many oriented structures. For instance, if $F_k$ is the set of homomorphic images of the directed path on $k+1$ vertices, then a…
A graphical model provides a compact and efficient representation of the association structure of a multivariate distribution by means of a graph. Relevant features of the distribution are represented by vertices, edges and other…
We study the set of all determinants of adjacency matrices of graphs with a given number of vertices.
We introduce the quadratic harness condition and show that integrable quadratic harnesses have orthogonal martingale polynomials with a three step recurrence that satisfies a q-commutation relation. This implies that quadratic harnesses are…
We analyse the normal quotient structure of several infinite families of finite connected edge-transitive, four-valent oriented graphs. These families were singled out by Marusic and others to illustrate various different internal…
We give some results on quadratic normality of reducible curves canonically embedded and partially extend this study to their projective normality.
We search for rational, four-dimensional maps of standard type (x_{n+1} - 2x_n + x_{n-1} = eps f(x,eps)) possessing one or two polynomial integrals. There are no non-trivial maps corresponding to cubic oscillators, but we find a…
Regular colored graphs are dual representations of pure colored D-dimensional complexes. These graphs can be classified with respect to an integer, their degree, much like maps are characterized by the genus. We analyse the structure of…
The Gaussian polynomial in variable $q$ is defined as the $q$-analog of the binomial coefficient. In addition to remarkable implications of these polynomials to abstract algebra, matrix theory and quantum computing, there is also a…
We study the correlation of edges, vectors or elements to be in a randomly chosen spanning tree or a basis, respectively. Here we follow the guideline of Huh and Wang and introduce as a measure an invariant that is called the correlation…
We characterise the form of all simple, finite graphs for which the girth of the graph is equal to the circumference of the graph. We apply this to prove a bound on the number of edges in such a graph.
The definitions and some basic properties of the linear transports along paths in vector bundles and the normal frames for them are recalled. The formalism is specified on line bundles and applied to a geometrical description of the…
We study relations between geometric embeddings of graphs and the spectrum of associated matrices, focusing on outerplanar embeddings of graphs. For a simple connected graph $G=(V,E)$, we define a "good" $G$-matrix as a $V\times V$ matrix…
For any graph, we show that the graded permutation representation of the graph automorphism group given by matchings is strongly equivariantly log-concave. The proof gives a family of equivariant injections inspired by a combinatorial map…
Boundary conditions in quantum graph vertices are generally given in terms of a unitary matrix $U$. Observing that if $U$ has at most two eigenvalues, then the scattering matrix $\mathcal{S}(k)$ of the vertex is a linear combination of the…
On the basis of the explicit formulae for the action of the unitary group of exponentials corresponding to almost solvable extensions of a given closed symmetric operator with equal deficiency indices, we derive a new representation for the…