default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIrene Sciriha
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j23]Irene Sciriha, Zoran Stanic
:
The polynomial reconstruction problem: The first 50 years. Discret. Math. 346(6): 113349 (2023)- [j22]Irene Sciriha, Luke Collins:
The walks and CDC of graphs with the same main eigenspace. Discuss. Math. Graph Theory 43(2): 507-532 (2023) - 2022
- [j21]Nino Basic, Patrick W. Fowler, Tomaz Pisanski, Irene Sciriha:
On singular signed graphs with nullspace spanned by a full vector: signed nut graphs. Discuss. Math. Graph Theory 42(4): 1351-1382 (2022) - 2021
- [j20]Irene Sciriha, Xandru Mifsud, James L. Borg:
Nullspace vertex partition in graphs. J. Comb. Optim. 42(2): 310-326 (2021) - [j19]Irene Sciriha:
Joining Forces for Reconstruction Inverse Problems. Symmetry 13(9): 1687 (2021) - 2020
- [j18]Johann A. Briffa, Irene Sciriha:
On the displacement of eigenvalues when removing a twin vertex. Discuss. Math. Graph Theory 40(2): 435-450 (2020) - [j17]Patrick W. Fowler, John Baptist Gauci, Jan Goedgebeur, Tomaz Pisanski, Irene Sciriha:
Existence of regular nut graphs for degree at most 11. Discuss. Math. Graph Theory 40(2): 533-557 (2020)
2010 – 2019
- 2019
- [j16]Irene Sciriha, Didar A. Ali, John Baptist Gauci, Khidir Sharaf:
The conductivity of superimposed key-graphs with a common one-dimensional adjacency nullspace. Ars Math. Contemp. 16(1): 141-155 (2019) - [j15]Irene Sciriha, Josef Lauri, John Baptist Gauci, Peter Borg:
Preface: The Second Malta Conference in Graph Theory and Combinatorics. Discret. Appl. Math. 266: 1-2 (2019) - [j14]Irene Sciriha, Luke Collins:
Two-graphs and NSSDs: An algebraic approach. Discret. Appl. Math. 266: 92-102 (2019) - [i3]Johann A. Briffa, Irene Sciriha:
On the Displacement of Eigenvalues when Removing a Twin Vertex. CoRR abs/1904.05670 (2019) - [i2]Patrick W. Fowler, John Baptist Gauci, Jan Goedgebeur, Tomaz Pisanski, Irene Sciriha:
Existence of $d$-regular nut graphs for $d$ at most 11. CoRR abs/1908.11635 (2019) - 2018
- [j13]Irene Sciriha, Johann A. Briffa, Mark Debono:
Fast algorithms for indices of nested split graphs approximating real complex networks. Discret. Appl. Math. 247: 152-164 (2018) - [i1]Irene Sciriha, Johann A. Briffa, Mark Debono:
Fast Algorithms for Indices of Nested Split Graphs Approximating Real Complex Networks. CoRR abs/1803.00306 (2018) - 2017
- [j12]Patrick W. Fowler, Barry T. Pickup, Irene Sciriha, Martha Borg:
Spectra and structural polynomials of graphs of relevance to the theory of molecular conduction. Ars Math. Contemp. 13(2): 379-408 (2017) - 2016
- [j11]Alexander Farrugia, John Baptist Gauci, Irene Sciriha:
Complete graphs with zero diagonal inverse. Ars Math. Contemp. 11(2): 231-245 (2016) - [j10]Irene Sciriha, Alexander Farrugia:
No chemical graph on more than two vertices is nuciferous. Ars Math. Contemp. 11(2): 397-402 (2016) - [j9]Alexander Farrugia, John Baptist Gauci, Irene Sciriha:
Non-Singular graphs with a Singular Deck. Discret. Appl. Math. 202: 50-57 (2016) - 2013
- [j8]Irene Sciriha, Mark Debono, Marta Borg, Patrick W. Fowler, Barry T. Pickup:
Interlacing-extremal graphs. Ars Math. Contemp. 6(2): 261-278 (2013)
2000 – 2009
- 2009
- [j7]Irene Sciriha:
Maximal core size in singular graphs. Ars Math. Contemp. 2(2): 217-229 (2009) - 2008
- [j6]Irene Sciriha:
Coalesced and embedded nut graphs in singular graphs. Ars Math. Contemp. 1(1): 20-31 (2008) - [j5]Irene Sciriha, Patrick W. Fowler:
On nut and core singular fullerenes. Discret. Math. 308(2-3): 267-276 (2008) - 2007
- [j4]Irene Sciriha, Patrick W. Fowler:
Nonbonding Orbitals in Fullerenes: Nuts and Cores in Singular Polyhedral Graphs. J. Chem. Inf. Model. 47(5): 1763-1775 (2007) - 2001
- [j3]Ivan Gutman, Irene Sciriha:
On the nullity of line graphs of trees. Discret. Math. 232(1-3): 35-45 (2001)
1990 – 1999
- 1998
- [j2]Irene Sciriha:
On the construction of graphs of nullity one. Discret. Math. 181(1-3): 193-211 (1998) - 1997
- [j1]Irene Sciriha, Stanley Fiorini:
On the characteristic polynomial of homeomorphic images of a graph. Discret. Math. 174(1-3): 293-308 (1997)
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-20 23:04 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:
