Pełnotekstowe zasoby PLDML oraz innych baz dziedzinowych są już dostępne w nowej Bibliotece Nauki.
Zapraszamy na https://bibliotekanauki.pl
Preferencje help
Polish version English version Język
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 3

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych:  Laplacian spectrum
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available remote

On the Spectral Characterizations of Graphs

100%
Huang J., Li S.
Discussiones Mathematicae Graph Theory
|
2017
|
tom 37
|
nr 3
729-744
EN
Several matrices can be associated to a graph, such as the adjacency matrix or the Laplacian matrix. The spectrum of these matrices gives some informations about the structure of the graph and the question “Which graphs are determined by their spectrum?” is still a difficult problem in spectral graph theory. Let [...] 𝒰p2q ${\cal U}_p^{2q}$ be the set of graphs obtained from Cp by attaching two pendant edges to each of q (q ⩽ p) vertices on Cp, whereas [...] 𝒱p2q ${\cal V}_p^{2q}$ the subset of [...] 𝒰p2q ${\cal U}_p^{2q}$ with odd p and its q vertices of degree 4 being nonadjacent to each other. In this paper, we show that each graph in [...] 𝒰p2q ${\cal U}_p^{2q}$ , p even and its q vertices of degree 4 being consecutive, is determined by its Laplacian spectrum. As well we show that if G is a graph without isolated vertices and adjacency cospectral with the graph in [...] 𝒱pp−1={H} ${\cal V}_p^{p - 1} = \{ H\}$ , then G ≅ H.
2
Content available remote

On some characterizations of strong power graphs of finite groups

88%
Bhuniya A. K., Bera S.
Special Matrices
|
2016
|
tom 4
|
nr 1
121-129
EN
Let G be a finite group of order n. The strong power graph Ps(G) of G is the undirected graph whose vertices are the elements of G such that two distinct vertices a and b are adjacent if am1=bm2 for some positive integers m1, m2 < n. In this article we classify all groups G for which Ps(G) is a line graph. Spectrum and permanent of the Laplacian matrix of the strong power graph Ps(G) are found for any finite group G.
3
Content available remote

On the number of spanning trees, the Laplacian eigenvalues, and the Laplacian Estrada index of subdivided-line graphs

88%
Shang Y.
Open Mathematics
|
2016
|
tom 14
|
nr 1
641-648
EN
As a generalization of the Sierpiński-like graphs, the subdivided-line graph Г(G) of a simple connected graph G is defined to be the line graph of the barycentric subdivision of G. In this paper we obtain a closed-form formula for the enumeration of spanning trees in Г(G), employing the theory of electrical networks. We present bounds for the largest and second smallest Laplacian eigenvalues of Г(G) in terms of the maximum degree, the number of edges, and the first Zagreb index of G. In addition, we establish upper and lower bounds for the Laplacian Estrada index of Г(G) based on the vertex degrees of G. These bounds are also connected with the number of spanning trees in Г(G).
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.