default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHilal A. Ganie
Person information
- affiliation: University of Kashmir, Department of Mathematics, Srinagar, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j27]Shariefuddin Pirzada
, Rezwan Ul Shaban, Hilal A. Ganie, Leonardo Silva de Lima:
On the Ky Fan norm of the signless Laplacian matrix of a graph. Comput. Appl. Math. 43(1): 26 (2024)- [j26]Hilal A. Ganie, Shariefuddin Pirzada:
On the first outdegree Zagreb index of a digraph. Discret. Math. 347(1): 113726 (2024) - 2023
- [j25]Hilal A. Ganie, Bilal Ahmad Rather, Kinkar Chandra Das:
On the normalized distance laplacian eigenvalues of graphs. Appl. Math. Comput. 438: 127615 (2023) - [j24]Bilal A. Rather, Hilal A. Ganie, Yilun Shang:
Distance Laplacian spectral ordering of sun type graphs. Appl. Math. Comput. 445: 127847 (2023) - [j23]Hilal A. Ganie, Juan R. Carmona:
An (increasing) sequence of lower bounds for the spectral radius and energy of digraphs. Discret. Math. 346(1): 113118 (2023) - [j22]Hilal A. Ganie, Archana Ingole, Ujwala Deshmukh:
On the coefficients of skew Laplacian characteristic polynomial of digraphs. Discret. Math. Algorithms Appl. 15(5): 2250131:1-2250131:14 (2023) - [j21]Hilal A. Ganie:
Sharp bounds for spectral radius of Dα-matrix of graphs. Discret. Math. Algorithms Appl. 15(8): 2250166:1-2250166:13 (2023) - [j20]Hilal A. Ganie, Yilun Shang:
On the Laplacian and Signless Laplacian Characteristic Polynomials of a Digraph. Symmetry 15(1): 52 (2023) - 2022
- [j19]Abdollah Alhevaz, Maryam Baghipur, Hilal Ahmad Ganie, Kinkar Chandra Das:
On the Aα-spectral radius of connected graphs. Ars Math. Contemp. 23(1) (2022) - [j18]Maryam Baghipur, Modjtaba Ghorbani, Hilal A. Ganie, Shariefuddin Pirzada:
On the eigenvalues and spread of the generalized distance matrix of a graph. Comput. Appl. Math. 41(5) (2022) - [j17]Hilal A. Ganie:
On the Aα-spectrum of joined union of digraphs. Discret. Math. Algorithms Appl. 14(1): 2150086:1-2150086:17 (2022) - [j16]Abdollah Alhevaz, Maryam Baghipur, Hilal A. Ganie, Kinkar Chandra Das:
Bounds and extremal graphs for Harary energy. Discret. Math. Algorithms Appl. 14(5): 2150149:1-2150149:19 (2022) - [j15]Bilal A. Chat, Hilal A. Ganie, Altaf A. Bhat, Mohd Y. Bhat, Mehraj Ahmad Lone:
On the skew Laplacian spectral radius of a digraph. Discret. Math. Algorithms Appl. 14(5): 2150155:1-2150155:12 (2022) - [j14]Hilal A. Ganie, Bilal A. Rather, Shariefuddin Pirzada:
On a conjecture of Laplacian energy of trees. Discret. Math. Algorithms Appl. 14(6): 2250009:1-2250009:18 (2022) - 2021
- [j13]Shariefuddin Pirzada, Bilal A. Rather, Hilal A. Ganie, Rezwan Ul Shaban:
On α-adjacency energy of graphs and Zagreb index. AKCE Int. J. Graphs Comb. 18(1): 39-46 (2021) - [j12]Hilal A. Ganie:
On the distance Laplacian energy ordering of a tree. Appl. Math. Comput. 394: 125762 (2021) - [j11]Hilal A. Ganie, Abdollah Alhevaz, Maryam Baghipur:
On the sum of the generalized distance eigenvalues of graphs. Discret. Math. Algorithms Appl. 13(1): 2050100:1-2050100:16 (2021) - 2020
- [j10]Hilal A. Ganie:
On distance Laplacian spectrum (energy) of graphs. Discret. Math. Algorithms Appl. 12(5): 2050061:1-2050061:16 (2020) - [j9]Abdollah Alhevaz, Maryam Baghipur, Hilal A. Ganie, Yilun Shang:
The Generalized Distance Spectrum of the Join of Graphs. Symmetry 12(1): 169 (2020)
2010 – 2019
- 2019
- [j8]Hilal A. Ganie, Bilal A. Chat:
Bounds for the energy of weighted graphs. Discret. Appl. Math. 268: 91-101 (2019) - [j7]Hilal A. Ganie, Shariefuddin Pirzada, Rezwan Ul Shaban, X. Li:
Upper bounds for the sum of Laplacian eigenvalues of a graph and Brouwer's conjecture. Discret. Math. Algorithms Appl. 11(2): 1950028:1-1950028:15 (2019) - [j6]Hilal A. Ganie, U. Samee, Shariefuddin Pirzada, Ahmad M. Alghamadi:
Bounds for graph energy in terms of vertex covering and clique numbers. Electron. J. Graph Theory Appl. 7(2): 315-328 (2019) - [j5]Abdollah Alhevaz, Maryam Baghipur, Hilal Ahmad Ganie, Yilun Shang:
Bounds for the Generalized Distance Eigenvalues of a Graph. Symmetry 11(12): 1529 (2019) - 2017
- [j4]Hilal A. Ganie, Shariefuddin Pirzada:
On the bounds for signless Laplacian energy of a graph. Discret. Appl. Math. 228: 3-13 (2017) - 2016
- [j3]Shariefuddin Pirzada, Hilal A. Ganie, Merajuddin Siddique:
On some covering graphs of a graph. Electron. J. Graph Theory Appl. 4(2): 132-147 (2016) - 2015
- [j2]Shariefuddin Pirzada, Hilal A. Ganie:
On the construction of L-equienergetic graphs. AKCE Int. J. Graphs Comb. 12(Issues): 141-154 (2015) - [j1]Hilal A. Ganie, Shariefuddin Pirzada, Edy Tri Baskoro:
On energy, Laplacian energy and p-fold graphs. Electron. J. Graph Theory Appl. 3(1): 94-107 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
