Related papers: On Spectra of Starlike Graphs
Measuring the stellar position angle provides valuable information on binary stellar formation or stellar spin axis evolution. We aim to develop a method for determining the absolute stellar position angle using spectro-astrometric analysis…
Graph matrices are a type of matrix which has played a crucial role in analyzing the sum of squares hierarchy on average case problems. However, except for rough norm bounds, little is known about graph matrices. In this paper, we take a…
Here, we represent a general hypergraph by a matrix and study its spectrum. We extend the definition of equitable partition and joining operation for hypergraphs, and use those to compute eigenvalues of different hypergraphs. We derive the…
We introduce a set of iterative equations that exactly solves the size distribution of components on small arbitrary graphs after the random removal of edges. We also demonstrate how these equations can be used to predict the distribution…
We propose a new method for determining the stochastic or ordered nature of trajectories in non-integrable Hamiltonian dynamical systems. The method consists of constructing a time-series from the divergence of nearby trajectories and then…
A derivation of the spectral determinant of the Schr\"odinger operator on a metric graph is presented where the local matching conditions at the vertices are of the general form classified according to the scheme of Kostrykin and Schrader.…
In the present investigation, we study the class of Sigmoid starlike functions, given by $\mathcal{S}^*_{SG}=\{f\in\mathcal{A}: {zf'(z)}/{f(z)}\prec 2/(1+e^{-z})\}$ in context of estimating the sharp radius constants associated with several…
This work presents ideas for the determination of complete experiments using graphs, which are based on a recently published, modified form of Moravcsik's theorem. The lucid representation of complete experiments in terms of graphs, which…
In this paper we consider the complex uniformly resolvable decompositions of the complete graph $K_v$ into subgraphs such that each resolution class contains only blocks isomorphic to the same graph from a given set $\mathcal H$. We…
Bicyclic graph is a connected graph in which the number of edges equals the number of vertices plus one. In this paper, we determine the graph which alone maximizes the spectral radii among all the bicyclic graphs on $n$ vertices with fixed…
We show that the strongly regular graph on non-isotropic points of one type of the polar spaces of type $U(n, 2)$, $O(n, 3)$, $O(n, 5)$, $O^+(n, 3)$, and $O^-(n, 3)$ are not determined by its parameters for $n \geq 6$. We prove this by…
In this paper, we investigate some properties of the Perron vector of connected graphs. These results are used to characterize that all extremal connected graphs with having the minimum (maximum) spectra radius among all connected graphs of…
Determining whether two graphs are structurally identical is a fundamental problem with applications spanning mathematics, computer science, chemistry, and network science. Despite decades of study, graph isomorphism remains a challenging…
An edge-colouring of a graph is distinguishing, if the only automorphism which preserves the colouring is the identity. It has been conjectured that all but finitely many connected, finite, regular graphs admit a distinguishing…
The goal of this paper is to describe a sufficient condition on cycles in graphs for which the edge ideal is splittable. We give an explicit splitting function for such ideals.
We consider edge colorings of a graph in such a way that each two different triangles have distinct colorings. It is an extension of the well-known idea of distinguishing all maximal stars in a graph. It was introduced in literature in 1985…
A rainbow colouring of a connected graph is a colouring of the edges of the graph, such that every pair of vertices is connected by at least one path in which no two edges are coloured the same. Such a colouring using minimum possible…
We prove that the graph of a continuous function $f$, defined on a domain of ${\mathbb C}^n$, is pluripolar if and only if $f$ is holomorphic.
We study the spectral multiplicity of Jacobi operators on star-like graphs with $m$ branches. Recently, it was established that the multiplicity of the singular continuous spectrum is at most $m$. Building on these developments and using…
The spectrum of a group is the set of its element orders. A finite group $G$ is said to be recognizable by spectrum if every finite group that has the same spectrum as $G$ is isomorphic to $G$. We prove that the simple alternating groups…