SearcharxivSearch

arXiv subjects

Zoran Stanic

Publications and source records attributed to Zoran Stanic.

5 recordsLinked to original sources

Signless Laplacian characterization of cones over disjoint unions of cycles, edges and isolated vertices

Two graphs are said to be $Q$-cospectral if they share the same signless Laplacian spectrum. A simple graph is said to be determined by its signless Laplacian spectrum (abbreviated as DQS) if there exists no other non-isomorphic simple graph with the same signless Laplacian spectrum. In this paper, we establish the following results: (1) Let$G \cong K_{1} \vee \bigl(C_{k} \cup qK_{2} \cup sK_{1}\bigr),$ with $q,s \geq 1$, $k \geq 4$, and at least $21$ vertices. If $k$ is odd, then $G$ is DQS. Moreover, if $k$ is even and $F$ is $Q$-cospectral with $G$, then $$F \cong G \quad \text{or} \quad F \cong K_{1} \vee \bigl(C_{4} \cup P_{k-3} \cup P_{3} \cup (q-2)K_{2} \cup sK_{1}\bigr).$$ (2) Let $G\cong K_1\vee (C_{k_1}\cup C_{k_2}\cup\cdots \cup C_{k_t}\cup qK_2\cup sK_1)$ with $t\ge 2$, $q,s\ge 1$, $k_i\ge 4$ and at least $33$ vertices. If each $k_i$ is odd, then $G$ is DQS. (3) The graph $K_{1} \vee \bigl(C_{3} \cup C_{k_{1}} \cup C_{k_{2}} \cup \cdots \cup C_{k_{t-1}} \cup qK_{2} \cup sK_{1}\bigr),$ with $t,q,s \geq 1$ and $k_{i} \geq 3$, is not DQS. Moreover, it is $Q$-cospectral with $K_{1} \vee \bigl(K_{1,3} \cup C_{k_{1}} \cup C_{k_{2}} \cup \cdots \cup C_{k_{t-1}} \cup qK_{2} \cup (s-1)K_{1}\bigr).$ Here $P_{n}$, $C_{n}$, $K_{n}$ and $K_{n-r,r}$ denote the path, the cycle, the complete graph and the complete bipartite graph on $n$ vertices, while $\cup$ and $\vee$ represent the disjoint union and the join of two graphs, respectively. Furthermore, the signless Laplacian spectrum of the graphs under consideration is computed explicitly.

math.CO

Laplacian eigenvalues and eigenspaces of cographs generated by finite sequence

In this paper we consider particular graphs defined by $\overline{\overline{\overline{K_{\alpha_1}}\cup K_{\alpha_2}}\cup\cdots \cup K_{\alpha_k}}$, where $k$ is even, $K_\alpha$ is a complete graph on $\alpha$ vertices, $\cup$ stands for the disjoint union and an overline denotes the complementary graph. These graphs do not contain the $4$-vertex path as an induced subgraph, i.e., they belong to the class of cographs. In addition, they are iteratively constructed from the generating sequence $(\alpha_1, \alpha_2, \ldots, \alpha_k)$. Our primary question is what invariants or graph properties can be deduced form a given sequence. In this context, we compute the Lapacian eigenvalues and the corresponding eigenspaces, and derive a lower and an upper bound for the number of distinct Laplacian eigenvalues. We also determine the graphs under consideration with a fixed number of vertices that either minimize or maximize the algebraic connectivity (that is the second smallest Laplacian eigenvalue). The clique number is computed in terms of a generating sequence and a relationship between it and the algebraic connectivity is established.

math.CO

On joins of a clique and a co-clique as star complements in regular graphs

In this paper we consider $r$-regular graphs $G$ that admit the vertex set partition such that one of the induced subgraphs is the join of an $s$-vertex clique and a $t$-vertex co-clique and represents a star complement for an eigenvalue $μ$ of $G$. The cases in which one of the parameters $s, t$ is less than 2 or $μ=r$ are already resolved. It is conjectured in [J. Wang, X. Yuan, L. Liu, Regular graphs with a prescribed complete multipartite graph as a star complement, Linear Algebra Appl.~579 (2019) 302--319] that if $s, t\geq 2$ and $μ\neq r$, then $μ=-2, t=2$ and $G=\overline{(s+1)K_2}$. For $μ=-t$ we verify this conjecture to be true. We further study the case in which $μ\neq-t$ and confirm the conjecture provided $t^2-4μ^2t-4μ^3=0$. For the remaining possibility we determine the structure of a putative counterexample and relate its existence to the existence of a particular 2-class block design. It occurs that the smallest counterexample would have 1265 vertices.

math.CO

Notes on Hamiltonian threshold and chain graphs

We revisit results obtained in [F. Harary, U. Peled, Hamiltonian threshold graphs, Discrete Appl.~Math., 16 (1987), 11--15], where several necessary and necessary and sufficient conditions for a connected threshold graph to be Hamiltonian were obtained. We present these results in new forms, now stated in terms of structural parameters that uniquely define the threshold graph and we extend them to chain graphs. We also identify the chain graph with minimum number of Hamilton cycles within the class of Hamiltonian chain graphs of a given order.

math.CO

On eigenvalue multiplicity in signed graphs

For signed graphs we provide a cubic polynomial upper bound on the multiplicity of its eigenvalues. We show that this bound is sharp by providing examples of signed graphs in which it is attained. We also discuss particular cases in which the bound can be decreased.

math.CO