Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2312.12845

r-orientation of a signed graph and its application on coronae of signed graphs

Satyam Guragain·Ravi Srivastava·Bishal Sonar
View original source ↗Read source document ↗Export metadata ↓

Abstract

For unsigned graphs G and H, the characteristic polynomial of different graph matrices for edge corona, subdivision vertex neighbourhood corona and subdivision edge neighbourhood corona has already been studied using the concept of coronal. However, till date no work regarding the spectrum of these products has been studied for signed graphs. In our work, we have filled this gap and defined these variants of coronae by introducing the concept of reverse orientation (r-orientation). We analyzed the structural properties of these product. Also, the characteristic polynomial of adjacency matrix, Laplacian matrices (signed and signless) and normalized Laplacian matrix of these variants of corona product of regular signed graphs under $r$-orientation is obtained using the concept of signed coronal. These results help us to construct infinitely many families of pairs of cospectral signed graphs.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Satyam Guragain, Ravi Srivastava, Bishal Sonar. 2024-01-10. r-orientation of a signed graph and its application on coronae of signed graphs. https://arxiv.org/abs/2312.12845

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

On nut graphs with two vertex and three edge orbits

Nut graphs are graphs whose adjacency matrix is singular with one-dimensional null space spanned by a vector with no zero entries. In a recent paper, Bašić, Fowler and Pisanski proved that the automorphism group of a nut graph has more orbits on the edge set than on the vertex set. They classified all orders for which a vertex-transitive nut graph with precisely two edge orbits exists, and conjectured that a nut graph with two vertex and three edge orbits exists for each non-prime order $n \ge 9$. Motivated by this conjecture, we introduce a very general construction that provides graphs with the desired symmetry properties, and we determine some sufficient spectral and structural conditions under which they are nut graphs. The construction yields infinite families of examples and confirms the above conjecture for all odd non-prime orders up to $2\,500$ and for at least $99.8$ percent of all odd non-prime orders up to a million. Finally, we present some additional interesting examples of nut graphs with two vertex and three edge orbits that do not arise from this construction.

math.CO↗
arXiv2026

On vertex-minimal simplicial maps to the sphere

For positive integers $n,d$, let $λ(n,d)$ be the minimal number of vertices of a triangulation of the $n$-sphere which admits a degree $d$ simplicial map onto the boundary of the $(n+1)$-simplex. We show that for $h=\lfloor\frac{n+1}2\rfloor$, the function $λ(n,d)^h$ has linear order of growth in $d$, answering a question of O. Musin. All triangulations we obtained are isomorphic to boundaries of convex polytopes in $\mathbb{R}^{n+1}$.

math.CO↗