default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVijay Kumar Bhat
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j14]Sunny Kumar Sharma
, Vijay Kumar Bhat, Pradeep Singh:
On metric dimension of some planar graphs with 2n odd sided faces. Discret. Math. Algorithms Appl. 16(1): 2250185:1-2250185:19 (2024)- 2023
- [j13]Sunny Kumar Sharma, Vijay Kumar Bhat:
Computing vertex resolvability of some regular planar graphs. Discret. Math. Algorithms Appl. 15(3): 2250086:1-2250086:13 (2023) - [j12]Sohan Lal, Vijay Kumar Bhat:
On the dominant local metric dimension of some planar graphs. Discret. Math. Algorithms Appl. 15(7): 2250152:1-2250152:20 (2023) - [j11]Sunny Kumar Sharma, Vijay Kumar Bhat:
Independence in multiresolving sets of graphs. Int. J. Comput. Math. Comput. Syst. Theory 8(2): 99-107 (2023) - 2022
- [j10]Karnika Sharma, Vijay Kumar Bhat, Sunny Kumar Sharma:
Edge Metric Dimension and Edge Basis of One-Heptagonal Carbon Nanocone Networks. IEEE Access 10: 29558-29566 (2022) - [j9]Sahil Sharma, Vijay Kumar Bhat:
Fault-tolerant metric dimension of zero-divisor graphs of commutative rings. AKCE Int. J. Graphs Comb. 19(1): 24-30 (2022) - [j8]Sunny Kumar Sharma, Vijay Kumar Bhat:
Fault-tolerant metric dimension of two-fold heptagonal-nonagonal circular ladder. Discret. Math. Algorithms Appl. 14(3): 2150132:1-2150132:23 (2022) - [j7]Sahil Sharma, Vijay Kumar Bhat:
Vertex resolvability of convex polytopes with n-paths of length p. Int. J. Comput. Math. Comput. Syst. Theory 7(2): 129-138 (2022) - [j6]Pradeep Singh, Vijay Kumar Bhat:
Graph invariants of the line graph of zero divisor graph of $$\mathbb {Z}_{n}$$. J. Appl. Math. Comput. 68(2): 1271-1287 (2022) - [j5]Sunny Kumar Sharma, Vijay Kumar Bhat:
On metric dimension of plane graphs with $\frac{m}{2}$ number of 10 sided faces. J. Comb. Optim. 44(3): 1433-1458 (2022) - 2021
- [j4]Sunny Kumar Sharma, Vijay Kumar Bhat:
Metric dimension of heptagonal circular ladder. Discret. Math. Algorithms Appl. 13(1): 2050095:1-2050095:17 (2021) - [j3]Pradeep Singh, Vijay Kumar Bhat:
Adjacency matrix and Wiener index of zero divisor graph $$\varGamma (Z_n)$$. J. Appl. Math. Comput. 66(1-2): 717-732 (2021)
2010 – 2019
- 2010
- [j2]Vijay Kumar Bhat:
A Note on Completely Prime Ideals of Ore Extensions. Int. J. Algebra Comput. 20(3): 457-463 (2010)
2000 – 2009
- 2009
- [c3]Ajay Koul, R. B. Patel, Vijay Kumar Bhat:
Double Split Based Secure Multipath Routing in Adhoc Networks. ARTCom 2009: 835-839 - 2007
- [j1]Vijay Kumar Bhat:
Polynomial Rings over Pseudovaluation Rings. Int. J. Math. Math. Sci. 2007: 20138:1-20138:6 (2007) - [c2]Neeraj Kumar Nehra, R. B. Patel, Vijay Kumar Bhat:
Routing with Load Balancing in Ad Hoc Network: A Mobile Agent Approach. ACIS-ICIS 2007: 489-495 - [c1]Neeraj Kumar Nehra, R. B. Patel, Vijay Kumar Bhat:
MASD: Mobile Agent Based Service Discovery in Ad Hoc Networks. HiPC 2007: 612-624
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 21:23 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:
