default search action
Peter Rowlinson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2022
- [j17]Peter Rowlinson, Zoran Stanic
:
Signed graphs whose spectrum is bounded by -2. Appl. Math. Comput. 423: 126991 (2022) - [j16]Farzaneh Ramezani, Peter Rowlinson, Zoran Stanic
More on signed graphs with at most three eigenvalues. Discuss. Math. Graph Theory 42(4): 1313-1331 (2022) - 2020
- [j15]Farzaneh Ramezani, Peter Rowlinson, Zoran Stanic
On eigenvalue multiplicity in signed graphs. Discret. Math. 343(10): 111982 (2020) - [j14]Dragos M. Cvetkovic, Peter Rowlinson:
Slobodan Simić: an appreciaton. Discuss. Math. Graph Theory 40(2): 367-378 (2020) - [j13]Peter Rowlinson:
On trees as star complements in regular graphs. Discuss. Math. Graph Theory 40(2): 621-636 (2020) - 2019
- [j12]Peter Rowlinson:
Eigenvalue multiplicity in regular graphs. Discret. Appl. Math. 269: 11-17 (2019) - 2013
- [j11]Peter Rowlinson
On graphs with an eigenvalue of maximal multiplicity. Discret. Math. 313(11): 1162-1166 (2013) - 2008
- [j10]Mustapha Aouchiche
Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph. Eur. J. Oper. Res. 191(3): 661-676 (2008) - 2005
- [j9]Dragos M. Cvetkovic, Peter Rowlinson
Graphs With Least Eigenvalue -2: A New Proof of the 31 Forbidden Subgraphs Theorem. Des. Codes Cryptogr. 34(2-3): 229-240 (2005) - 2002
- [j8]Dragos M. Cvetkovic, Mirko Lepovic, Peter Rowlinson
The Maximal Exceptional Graphs. J. Comb. Theory B 86(2): 347-363 (2002) - 2000
- [j7]Peter Rowlinson, Francis K. Bell:
Graph eigenspaces of small codimension. Discret. Math. 220(1-3): 271-278 (2000) - 1999
- [j6]Francis K. Bell, Dragos M. Cvetkovic, Peter Rowlinson, Slobodan K. Simic:
Some additions to the theory of star partitions of graphs. Discuss. Math. Graph Theory 19(2): 119-134 (1999) - 1996
- [j5]Peter Rowlinson:
The Characteristic Polynomials of Modified Graphs. Discret. Appl. Math. 67(1-3): 209-219 (1996) - 1995
- [j4]Dragos M. Cvetkovic, Peter Rowlinson
on Some Algorithmic Investigations of Star Partitions of Graphs. Discret. Appl. Math. 62(1-3): 119-130 (1995) - 1994
- [j3]Yuansheng Yang, Peter Rowlinson
The third Ramsey numbers for graphs with at most four edges. Discret. Math. 125(1-3): 399-406 (1994) - 1989
- [j2]Peter Rowlinson:
On Hamiltonian Graphs with Maximal Index. Eur. J. Comb. 10(5): 489-497 (1989) - 1987
- [j1]Dragos M. Cvetkovic, Peter Rowlinson
Spectra of unicyclic graphs. Graphs Comb. 3(1): 7-23 (1987)
Conference and Workshop Papers
- 1998
- [c1]Peter Rowlinson:
Star sets and star complements in finite graphs: A spectral construction technique. Discrete Mathematical Chemistry 1998: 323-332
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 2025-01-09 13:20 CET 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: