default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGurusamy Rengasamy Vijayakumar
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2015
[j22]Gurusamy Rengasamy Vijayakumar:
Packing functions and dominating functions of countable graphs. Discret. Math. 338(12): 2495-2501 (2015)- [j21]Gurusamy Rengasamy Vijayakumar:
Uniquely Derived Generalized Line Graphs and Uniquely Represented Signed Graphs with Least Eigenvalues ≥ -2. Graphs Comb. 31(4): 1053-1063 (2015) - 2014
- [j20]Subramanian Arumugam
, Nainarraj Kamatchi, Gurusamy Rengasamy Vijayakumar:
On the uniqueness of D-vertex magic constant. Discuss. Math. Graph Theory 34(2): 279-286 (2014) - 2013
- [j19]Gurusamy Rengasamy Vijayakumar:
Dominating functions and total dominating functions of countable graphs. Discret. Math. 313(21): 2506-2511 (2013) - [j18]Gurusamy Rengasamy Vijayakumar:
Characterizations of the family of all generalized line graphs-finite and infinite- and classification of the family of all graphs whose least eigenvalues ≥ -2. Discuss. Math. Graph Theory 33(4): 637-648 (2013) - [j17]Gurusamy Rengasamy Vijayakumar:
Some Results on Weighted Graphs without Induced Cycles of Nonpositive Weights. Graphs Comb. 29(4): 1101-1111 (2013) - 2012
- [j16]Gurusamy Rengasamy Vijayakumar:
Some results on near factorizations of boolean groups. Australas. J Comb. 53: 135-140 (2012) - 2011
- [j15]Gurusamy Rengasamy Vijayakumar:
A property of weighted graphs without induced cycles of nonpositive weights. Discret. Math. 311(14): 1385-1387 (2011) - [j14]Gurusamy Rengasamy Vijayakumar:
On Partitioning the Edge Set of a Graph into Internally Disjoint Paths without Exterior Vertices. Graphs Comb. 27(1): 143-148 (2011) - [j13]Gurusamy Rengasamy Vijayakumar:
Equivalence of four descriptions of generalized line graphs. J. Graph Theory 67(1): 27-33 (2011) - 2010
- [j12]Gurusamy Rengasamy Vijayakumar:
Arithmetic labelings and geometric labelings of countable graphs. Discuss. Math. Graph Theory 30(4): 539-544 (2010) - 2008
- [j11]Gurusamy Rengasamy Vijayakumar:
A result related to the largest eigenvalue of a tree. Discuss. Math. Graph Theory 28(3): 557-561 (2008) - 2007
- [j10]Gurusamy Rengasamy Vijayakumar:
Partitions of the edge set of a graph into internally disjoint paths. Australas. J Comb. 39: 241-246 (2007) - [j9]Amitava Bhattacharya, Gurusamy Rengasamy Vijayakumar:
An integrality theorem of root systems. Eur. J. Comb. 28(6): 1854-1862 (2007) - 2003
- [j8]Amitava Bhattacharya, Gurusamy Rengasamy Vijayakumar:
An Integrality Theorem of Root Systems. Electron. Notes Discret. Math. 15: 44 (2003) - 2002
- [j7]N. M. Singhi, Gurusamy Rengasamy Vijayakumar, N. Usha Devi:
Set-magic labelings of infinite graphs. Ars Comb. 63 (2002) - [j6]Amitava Bhattacharya, Gurusamy Rengasamy Vijayakumar:
Effect of edge-subdivision on vertex-domination in a graph. Discuss. Math. Graph Theory 22(2): 335-347 (2002) - 1999
- [j5]N. Usha Devi, Gurusamy Rengasamy Vijayakumar:
Hereditary properties of graphs. Discret. Math. 206(1-3): 213-215 (1999) - 1994
- [j4]Gurusamy Rengasamy Vijayakumar:
Representation of Signed Graphs by Root System E8. Graphs Comb. 10(2-4): 383-388 (1994) - 1992
- [j3]Navin M. Singhi, Gurusamy Rengasamy Vijayakumar:
Signed graphs with least eigenvalue <-2. Eur. J. Comb. 13(3): 219-220 (1992) - 1990
- [j2]P. D. Chawathe, Gurusamy Rengasamy Vijayakumar:
A Characterization of Signed Graphs Represented by Root System D℞. Eur. J. Comb. 11(6): 523-533 (1990) - 1987
- [j1]Gurusamy Rengasamy Vijayakumar:
Signed Graphs Represented by D∞. Eur. J. Comb. 8(1): 103-112 (1987)
Conference and Workshop Papers
- 2016
- [c1]Nainarraj Kamatchi, Gurusamy Rengasamy Vijayakumar, A. Ramalakshmi, S. Nilavarasi, S. Arumugam:
Distance Antimagic Labelings of Graphs. ICTCSDM 2016: 113-118
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 21:15 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:
