default search action
Jay S. Bagga
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j9]Jay S. Bagga, Lowell W. Beineke:
New results and open problems in line graphs. AKCE Int. J. Graphs Comb. 19(3): 182-190 (2022) - 2020
- [j8]S. Arumugam
, Jay S. Bagga:
Preface. AKCE Int. J. Graphs Comb. 17(2): 637 (2020) - [j7]S. Arumugam
Graphoidal graphs and graphoidal digraphs: a generalization of line graphs. AKCE Int. J. Graphs Comb. 17(2): 660-664 (2020) - [j6]Pambe Biatch' Max, Jay S. Bagga, S. Arumugam
A survey and a new class of graceful unicylic graphs. AKCE Int. J. Graphs Comb. 17(2): 673-678 (2020)
2010 – 2019
- 2017
- [e1]S. Arumugam, Jay S. Bagga, Lowell W. Beineke, B. S. Panda:
Theoretical Computer Science and Discrete Mathematics - First International Conference, ICTCSDM 2016, Krishnankoil, India, December 19-21, 2016, Revised Selected Papers. Lecture Notes in Computer Science 10398, Springer 2017, ISBN 978-3-319-64418-9 [contents] - 2016
- [j5]Jay S. Bagga, Lowell W. Beineke, Badri N. Varma:
A number theoretic problem on super line graphs. AKCE Int. J. Graphs Comb. 13(2): 177-190 (2016) - 2015
- [j4]Jay S. Bagga, Laure Pauline Fotso, Pambe Biatch' Max, S. Arumugam
New Classes of Graceful Unicyclic Graphs. Electron. Notes Discret. Math. 48: 27-32 (2015)
2000 – 2009
- 2005
- [c5]Jay S. Bagga, Daniela Ferrero
The structure of super line graphs. ISPAN 2005: 468-471 - 2004
- [j3]Jay S. Bagga:
Old and new generalizations of line graphs. Int. J. Math. Math. Sci. 2004(29): 1509-1521 (2004) - 2003
- [c4]Siba K. Udgata, Jay S. Bagga:
A Cluster-Oriented Mutual Exclusion Algorithm for Mobile Ad Hoc Network. PDPTA 2003: 857-863 - 2001
- [c3]Jay S. Bagga, Adrian Heinz:
JGraph - A Java Based System for Drawing Graphs and Running Graph Algorithms. GD 2001: 459-460
1990 – 1999
- 1999
- [j2]Jay S. Bagga, Lowell W. Beineke, Badri N. Varma:
Independence and cycles in super line graphs. Australas. J Comb. 19: 171-178 (1999) - [j1]Jay S. Bagga, Lowell W. Beineke, Badri N. Varma:
The super line graph L2. Discret. Math. 206(1-3): 51-61 (1999) - 1997
- [c2]Laxmi P. Gewali, Jay S. Bagga, S. Dey, J. Emert, J. McGrew:
Contracted visibility graphs of line segments. CCCG 1997 - 1996
- [c1]Jay S. Bagga, Laxmi P. Gewali, David Glasser:
The Complexity of Illuminating Polygons by alpha-flood-lights. CCCG 1996: 337-342
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-08-05 20:17 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: