Zobrazeno 1 - 10
of 71
pro vyhledávání: '"Hilal A Ganie"'
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 4, Iss 2, Pp 132-147 (2016)
For a graph $G$ with vertex set $V(G)=\{v_1, v_2, \dots, v_n\}$, let $S$ be the covering set of $G$ having the maximum degree over all the minimum covering sets of $G$. Let $N_S[v]=\{u\in S : uv \in E(G) \}\cup \{v\}$ be the closed neighbourhood of t
Externí odkaz:
https://doaj.org/article/0d2ccc7199d045f798b85ce7bf705cc8
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 3, Iss 1, Pp 94-107 (2015)
For a graph $G$ having adjacency spectrum ($A$-spectrum) $\lambda_n\leq\lambda_{n-1}\leq\cdots\leq\lambda_1$ and Laplacian spectrum ($L$-spectrum) $0=\mu_n\leq\mu_{n-1}\leq\cdots\leq\mu_1$, the energy is defined as $ E(G)=\sum_{i=1}^{n}|\lambda_i|$ a
Externí odkaz:
https://doaj.org/article/933438e38b024751b122454ee596dc63
Publikováno v:
Mathematics, Vol 12, Iss 15, p 2366 (2024)
In the paper, we introduce the signless Laplacian ABC-matrix Q̃(G)=D¯(G)+Ã(G), where D¯(G) is the diagonal matrix of ABC-degrees and Ã(G) is the ABC-matrix of G. The eigenvalues of the matrix Q̃(G) are the signless Laplacian ABC-eigenvalues o
Externí odkaz:
https://doaj.org/article/312348aca1a94ccaa8bfb51caa3bba68
Autor:
Adnan Firdous Raina, Amit Chandra, Waseem Dar, Hilal Ahmad Ganie, Zubair Kawaja, Maqbool Wani, Ravouf Asimi
Publikováno v:
Current Medical Issues, Vol 21, Iss 1, Pp 14-18 (2023)
Background: Cerebral venous sinus thrombosis (CVST) accounts for 10%–20% of strokes in young persons. In India, CVST accounts for around 30% of all strokes. The majority of CVSTs are caused by procoagulant circumstances, with pregnancy and early pu
Externí odkaz:
https://doaj.org/article/bb08e0f27f3b4169a358b7cea0fe2554
Publikováno v:
The Egyptian Journal of Neurology, Psychiatry and Neurosurgery, Vol 59, Iss 1, Pp 1-7 (2023)
Key Message Hypokalemic paralysis is an important differential diagnosis of acute flaccid paralysis that rapidly recovers with treatment. Most of the cases are primary, usually a calcium channel disorder (Type I) or very rarely a sodium channel disor
Externí odkaz:
https://doaj.org/article/15edf27d3bea464bbf2b2bbe4266e4c3
Publikováno v:
Mathematics, Vol 12, Iss 2, p 192 (2024)
In this article, we discuss the spectral properties of the general extended adjacency matrix for chain graphs. In particular, we discuss the eigenvalues of the general extended adjacency matrix of the chain graphs and obtain its general extended adja
Externí odkaz:
https://doaj.org/article/d7f46b0e1baf438280289be332d07530
Autor:
Amit Chandra, Maqbool Wani, Adnan Firdous Raina, Hilal Ahmad Ganie, Waseem Dar, Arjimand Yaqoob, Ravouf Asimi
Publikováno v:
Current Medical Issues, Vol 20, Iss 3, Pp 125-129 (2022)
Background: A stroke is defined by the rapid emergence of clinical symptoms and focuses on evidence (applicable to individuals in a deep coma and those with subarachnoid hemorrhage) or widespread brain damage. The study aimed to evaluate the clinical
Externí odkaz:
https://doaj.org/article/33dafde13d8445aea01c8c1a6b5d0e78
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 18, Iss 1, Pp 39-46 (2021)
Let A(G) be the adjacency matrix and D(G) be the diagonal matrix of the vertex degrees of a simple connected graph G. Nikiforov defined the matrix of the convex combinations of D(G) and A(G) as for If are the eigenvalues of (which we call α-adjacenc
Externí odkaz:
https://doaj.org/article/7e8a4111fd1f44d79dfd821325eccfaa
Autor:
Hilal A. Ganie, Yilun Shang
Publikováno v:
Heliyon, Vol 8, Iss 3, Pp e09186- (2022)
Let D be a digraph of order n and with a arcs. The signless Laplacian matrix Q(D) of D is defined as Q(D)=Deg(D)+A(D), where A(D) is the adjacency matrix and Deg(D) is the diagonal matrix of vertex out-degrees of D. Among the eigenvalues of Q(D) the
Externí odkaz:
https://doaj.org/article/841d57372a2e4767a77f019ec0a5cc13
Autor:
Hilal A. Ganie, Yilun Shang
Publikováno v:
Symmetry, Vol 15, Iss 1, p 52 (2022)
Let D be a digraph with n vertices and a arcs. The Laplacian and the signless Laplacian matrices of D are, respectively, defined as L(D)=Deg+(D)−A(D) and Q(D)=Deg+(D)+A(D), where A(D) represents the adjacency matrix and Deg+(D) represents the diago
Externí odkaz:
https://doaj.org/article/00755cd425de440fab941ca137bb26c9