Zobrazeno 1 - 10
of 20
pro vyhledávání: '"Seyed Ahmad Mojallal"'
Autor:
Shaun Fallat, Seyed Ahmad Mojallal
Publikováno v:
Mathematics, Vol 11, Iss 16, p 3595 (2023)
Using the notions of clique partitions and edge clique covers of graphs, we consider the corresponding incidence structures. This connection furnishes lower bounds on the negative eigenvalues and their multiplicities associated with the adjacency mat
Externí odkaz:
https://doaj.org/article/93fbb94a77e24512b6cd60e83eb607b3
Publikováno v:
Linear and Multilinear Algebra. 70:6345-6357
The symmetric Pascal matrix is a square matrix whose entries are given by binomial coefficients modulo 2. In 1997, Christopher and Kennedy defined and studied the binomial graph, which is the graph...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::efc337823453116e9164e1ca3569632c
https://doi.org/10.1080/03081087.2021.1954584
https://doi.org/10.1080/03081087.2021.1954584
Autor:
Seyed Ahmad Mojallal, Pierre Hansen
Publikováno v:
Discrete Applied Mathematics. 293:50-58
Proximity π and remoteness ρ are respectively the minimum and the maximum, over the vertices of a connected graph, of the average distance from a vertex to all others. The distance eigenvalues of a connected graph G , denoted by ∂ 1 ≥ ∂ 2 ≥
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1bacc7b0fb8e9523dbf79bf25d0051ab
https://doi.org/10.1016/j.dam.2021.01.014
https://doi.org/10.1016/j.dam.2021.01.014
Autor:
Pierre Hansen, Seyed Ahmad Mojallal
Publikováno v:
Linear Algebra and its Applications. 628:228-230
In this corrigendum, we report and correct some errors in Theorems 3.1 and 4.1 and hence Corollaries 4.2 and 4.3 in [Linear Algebra Appl. 595 (2020) 1–12].
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ade69c6aeb16b24fd25d67037f639321
https://doi.org/10.1016/j.laa.2021.07.011
https://doi.org/10.1016/j.laa.2021.07.011
Autor:
Shaun Fallat, Seyed Ahmad Mojallal
For a graph $G$, we associate a family of real symmetric matrices, $S(G)$, where for any $A\in S(G)$, the location of the nonzero off-diagonal entries of $A$ are governed by the adjacency structure of $G$. Let $q(G)$ be the minimum number of distinct
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d49d83cf34466679f66d31351a8f336a
http://arxiv.org/abs/2110.10143
http://arxiv.org/abs/2110.10143
Publikováno v:
Discrete Mathematics. 345:113016
In this paper, we study structural properties of Toeplitz graphs. We characterize $K_q$-free Toeplitz graphs for an integer $q \ge 3$ and give equivalent conditions for a Toeplitz graph $G_n\langle t_1, t_2,\ldots, t_k\rangle$ with $t_1
Comment:
Comment:
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2500d7402e497faca6b7b8f53a3c05cd
https://doi.org/10.1016/j.disc.2022.113016
https://doi.org/10.1016/j.disc.2022.113016
Publikováno v:
Linear Algebra and its Applications. 569:175-194
Let G be a graph of order n. Also let λ 1 ≥ λ 2 ≥ ⋯ ≥ λ n be the eigenvalues of graph G. In this paper, we present the following upper bound on the sum of the k ( ≤ n ) largest eigenvalues of G in terms of the order n and negative inerti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::258b8160c3b7b65e5026390bd587e0c3
https://doi.org/10.1016/j.laa.2019.01.016
https://doi.org/10.1016/j.laa.2019.01.016
Publikováno v:
Linear and Multilinear Algebra. 66:1403-1417
We obtain spectral properties of the Pascal graphs by exploring its spectral graph invariants such as the algebraic connectivity, the first three largest Laplacian eigenvalues and the nullity. Some open problems pertaining to the Pascal graphs are gi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::374f6a3ad5994ddf2c9627393e05665c
https://doi.org/10.1080/03081087.2017.1356261
https://doi.org/10.1080/03081087.2017.1356261
Publikováno v:
Linear Algebra and its Applications. 515:24-37
Let G be a simple graph of order n with maximum degree Δ and minimum degree δ. Let ( d ) = ( d 1 , d 2 , … , d n ) and ( d ⁎ ) = ( d 1 ⁎ , d 2 ⁎ , … , d n ⁎ ) be the sequences of degrees and conjugate degrees of G. We define π = ∑ i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2eb50143242d4c2ef82983ef72a52af6
https://doi.org/10.1016/j.laa.2016.11.009
https://doi.org/10.1016/j.laa.2016.11.009
Autor:
Kinkar Ch. Das, Seyed Ahmad Mojallal
Publikováno v:
Taiwanese J. Math. 23, no. 5 (2019), 1041-1059
Let $G$ be a graph of order $n$ with $m$ edges. Also let $\mu_1\geq \mu_2\geq \cdots\geq \mu_{n-1}\geq \mu_n=0$ be the Laplacian eigenvalues of graph $G$ and let $\sigma=\sigma(G)$ $(1\leq \sigma\leq n)$ be the largest positive integer such that $\mu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::517ba76ad7fead6804c13789faaff6b3
https://doi.org/10.11650/tjm/181104
https://doi.org/10.11650/tjm/181104