Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Mehrnoosh Javarsineh"'
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol vol. 24, no. 1, Iss Graph Theory (2022)
Layered treewidth and row treewidth are recently introduced graph parameters that have been key ingredients in the solution of several well-known open problems. It follows from the definitions that the layered treewidth of a graph is at most its row
Externí odkaz:
https://doaj.org/article/d23df7fef3614138ab44ebc16c748c5b
Autor:
L.S. de Lima, Saieed Akbari, E. Ghasemian, Francisca Andrea Macedo França, Mehrnoosh Javarsineh
Publikováno v:
Linear Algebra and its Applications. 614:270-280
A signed graph G σ is an ordered pair ( V ( G ) , E ( G ) ) , where V ( G ) and E ( G ) are the set of vertices and edges of G, respectively, along with a map σ that signs every edge of G with +1 or −1. An eigenvalue of the associated adjacency m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2503ed5c2c1bd27e0109a83a44f3161a
https://doi.org/10.1016/j.laa.2020.04.029
https://doi.org/10.1016/j.laa.2020.04.029
Publikováno v:
Applied Mathematics and Computation. 315:603-614
Finding all the graphs with a certain number of Q-main eigenvalues is an algebraic graph theory problem that scientists have sought to answer it for many years. The purpose of this research is finding relationships between the algebraic properties of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9ff37653894c692ac6d0a00f2948b8a2
https://doi.org/10.1016/j.amc.2017.06.033
https://doi.org/10.1016/j.amc.2017.06.033
Publikováno v:
Algebraic structures and their applications. 4:19-32
The undirected power graph of a finite group $G$, $P(G)$, is a graph with the group elements of $G$ as vertices and two vertices are adjacent if and only if one of them is a power of the other. Let $A$ be an adjacency matrix of $P(G)$. An eigenvalue
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a8cd83ebc80978aac72bce80382943f9
https://doi.org/10.29252/asta.4.1.19
https://doi.org/10.29252/asta.4.1.19
Publikováno v:
Filomat. 31:1803-1812
For a simple graph G, the Q-eigenvalues are the eigenvalues of the signless Laplacian matrix Q of G. A Q-eigenvalue is said to be a Q-main eigenvalue if it admits a corresponding eigenvector non orthogonal to the all-one vector, or alternatively if t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::15aa75989736ea1db46f7509a5d1f4c4
https://doi.org/10.2298/fil1706803j
https://doi.org/10.2298/fil1706803j
Publikováno v:
Distance, Symmetry, and Topology in Carbon Nanomaterials ISBN: 9783319315829
A (k,6)-fullerene graph is a planar 3-regular graph with k-polygon faces. In this chapter, we are going to obtain spectral moments of (k,6)-fullerene graph for k = 3,4,5 and use them for calculating the Estrada index of these graphs.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fa0c5c7fb0b87c7ba93671056ea76cc3
https://doi.org/10.1007/978-3-319-31584-3_11
https://doi.org/10.1007/978-3-319-31584-3_11
