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

Abstract

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) LetG K1 (Ck qK2 sK1), with q,s ≥ 1, k ≥ 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 G or F K1 (C4 Pk-3 P3 (q-2)K2 sK1). (2) Let G K1 (Ck1 Ck2·s Ckt qK2 sK1) with t 2, q,s 1, ki 4 and at least 33 vertices. If each ki is odd, then G is DQS. (3) The graph K1 (C3 Ck1 Ck2 ·s Ckt-1 qK2 sK1), with t,q,s ≥ 1 and ki ≥ 3, is not DQS. Moreover, it is Q-cospectral with K1 (K1,3 Ck1 Ck2 ·s Ckt-1 qK2 (s-1)K1). Here Pn, Cn, Kn and Kn-r,r denote the path, the cycle, the complete graph and the complete bipartite graph on n vertices, while and represent the disjoint union and the join of two graphs, respectively. Furthermore, the signless Laplacian spectrum of the graphs under consideration is computed explicitly.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…