Selected publications:

 

Sciriha, I., & Farrugia, A. (2021). From nutgraphs to molecular structure and conductivity. Mathematical Chemistry Monographs, University of Kragujevac, Series Eds. I. Gutman and B. Furtula.

Sciriha, I. (2021). Joining forces for reconstruction inverse problems. Symmetry, 13(9), 1687.

 

Sciriha, I., & Collins, L. (2021). The walks and CDC of graphs with the same main eigenspace. Discussiones Mathematicae Graph Theory, 1-26.

 

Sciriha, I., Mifsud, X., & Borg, J. L. (2021). Nullspace vertex partition in graphs. Journal of Combinatorial Optimization, 42, 310–326.

 

Fowler, P. W., Gauci, J. B., Goedgebeur, J., Pisanski, T., & Sciriha, I. (2020). Existence of regular nut graphs for degree at most 11. Discussiones Mathematicae Graph Theory, 40(2), 533-557.

 

Briffa, J. A., & Sciriha, I. (2020). On the displacement of eigenvalues when removing a twin vertex. Discussiones Mathematicae Graph Theory, 40(2), 435-450.

 

Mitchell, L., & Sciriha, I. (2020). A reduction procedure for the Colin de Verdière number of a graph. Linear Algebra and its Applications, 596, 36-48.

 

Fowler, P. W., Borg, M., Pickup, B. T., & Sciriha, I. (2020). Molecular graphs and molecular conduction: the d-omni-conductors. Physical Chemistry Chemical Physics, 22(3), 1349-1358.

 

Sciriha, I., & Collins, L. (2019). Two-graphs and NSSDs: An algebraic approach. Discrete Applied Mathematics, 266, 92-102.

 

Sciriha, I., Ali, D. A., Gauci, J. B., & Sharaf, K. R. (2018). The conductivity of superimposed key-graphs with a common one-dimensional adjacency nullspace. Ars Mathematica Contemporanea, 16(1), 141-155.

 

Sciriha, I., Briffa, J. A., & Debono, M. (2018). Fast algorithms for indices of nested split graphs approximating real complex networks. Discrete Applied Mathematics, 247, 152-164.

 

Fowler, P. W., Sciriha, I., Borg, M., Seville, V. E., & Pickup, B. T. (2017). Near omni-conductors and insulators : alternant hydrocarbons in the SSP model of ballistic conduction. The Journal of Chemical Physics, 147, 164115.

 

Farrugia, A., & Sciriha, I. (2017). Triangles in inverse NSSD graphs. Linear and Multilinear Algebra, 66(3).

 

Ali, D. A., Gauci, J. B., Sciriha, I., & Sharaf, K. R. (2016). Nullity of a graph with a cut-edge. MATCH Communications in Mathematical and in Computer Chemistry, 76, 771-791.

 

Sciriha, I., & Farrugia, A. (2016). No chemical graph on more than two vertices is nuciferous. Ars Mathematica Contemporanea, 11(2), 397-402.

 

Belardo, F., Sciriha, I., & Simic, S. K. (2016). On eigenspaces of some compound signed graphs. Linear Algebra and its Applications, 509, 19-39.

 

Pickup, B. T., Fowler, P. W., & Sciriha, I. (2016). A Huckel source-sink-potential theory of Pauli spin blockade in molecular electronic devices. The Journal of Chemical Physics, 145(20), 204113.

 

Pickup, B. T., Fowler, P. W., Borg, M., & Sciriha, I. (2015). A new approach to the method of source-sink potentials for molecular conduction. The Journal of Chemical Physics, 143(19), 194105.

 

Sciriha, I., Farrugia, A., & Gauci, J. B. (2014). The adjacency matrices of complete and nutful graphs. Match, 72(1), 165-178.

 

Debono, M., Lauri, J., & Sciriha, I. (2014). Balanced centrality of networks. International Scholarly Research Notices, 871038, 10.

 

Fowler, P. W., Pickup, B. T., Todorova, T. Z., Borg, M., & Sciriha, I. (2014). Omni-conducting and omni-insulating molecules. The Journal of Chemical Physics, 140(5), 054115.

 

Sciriha, I. & Simic, S. K. (2013). On eigenspaces of some compound graph. In (Eds.) M. Buratti et Al. (Eds.), Recent results in design and graphs. (pp. 401-418), Quaderni di Matematica, 28. Rome: Aracne.

 

Fowler, P. W., Pickup, B. T., Todorova, T. Z., De Los Reyes, R., & Sciriha, I. (2013). Omni-conducting fullerenes. Chemical Physics Letters, 568-569, 33-35.

 

Farrugia, A., Gauci, J. B., & Sciriha, I. (2013). On the inverse of the adjacency matrix of a graph. Special Matrices, 28-41.

 

Sciriha, I. (2012). Maximal and extremal singular graphs. Journal of Mathematical Sciences, 182(2), 117-125.

 

Sciriha, I., & Fonseca, C. M. da (2012). On the rank spread of graphs. Linear and Multilinear Algebra, 60(1), 73-92.

 

Sciriha, I., & Cardoso, D. M. (2012). Necessary and sufficient conditions for a Hamiltonian graph. Journal of Combinatorial Mathematics and Combinatorial Computing, 80, 127-150.

 

Sciriha, I., & Farrugia, S. (2011). On the spectrum of threshold graphs. ISRN Discrete Mathematics, 108509, 21 pages.

 

Sciriha, I. (2010). Extremal non-bonding orbitals. MATCH Communications in Mathematical and in Computer Chemistry, 63(3), 751-768.

 

Cardoso, D. M., Sciriha, I., & Zerafa, C. (2010). Main eigenvalues and (κ, τ)-regular sets. Linear Algebra and its Applications, 432(9), 2399-2408.

 

Sciriha, I. (2009). Graphs with a common eigenvalue deck. Linear Algebra and its Applications, 430(1), 78-85.

 

Sciriha, I. (2009). Maximal core size in singular graphs. ARS Mathematica Contemporanea, 2(2), 217-229.

 

Sciriha, I., & Fowler, P. W. (2008). On nut and core singular fullerenes. Discrete Mathematics, 308(2-3), 267-276.

 

AIM Minimum Rank – Special Graphs Work Group. (2008). Zero forcing sets and the minimum rank of graphs. Linear Algebra and its Applications, 428(7), 1628-1648.

 

Sciriha, I. (2007). A characterization of singular graphs. Electronic Journal of Linear Algebra, 16, 451-462.

 

Sciriha, I., & Fowler, P. W. (2007). Nonbonding orbitals in fullerenes :  nuts and cores in singular polyhedral graphs. Journal of Chemical Information and Modeling, 47(5), 1763-1775.

 

Rowlinson, P., & Sciriha, I. (2007). Some properties of the hoffman-singleton graph. Applicable Analysis and Discrete Mathematics, 1(2), 438-445.

 

Fiorini, S., Gutman, I., & Sciriha, I. (2005). Trees with maximum nullity. Linear Algebra and its Applications, 397, 245-251.

 

Sciriha, I. (2002). Polynomial reconstruction : old and new techniques. Rendiconti del Seminario Matematico Messina, 8(24)(II), 163-179.

 

Gutman, I., & Sciriha, I. (2001). On the nullity of line graphs of trees. Discrete Mathematics, 232(1-3), 35-45.

 

Sciriha I. (1999). On the rank of graphs. In Y. Alavi, D. R. Lick & A. Schwenk (Eds.), Graph theory and algorithms II (pp. 769-778). Michigan: Springer.

 

Sciriha, I., & Gutman, I. (1998). Nut graphs : maximally extending cores. Utilitas Mathematica, 54, 257-272.

 

Sciriha, I. (1998). On the construction of graphs of nullity one. Discrete Mathematics, 181(1-3), 193-211.

 

Sciriha, I. (1997). On the coefficient of λ in the characteristic polynomial of singular graphs. Utilitas Mathematica, 52, 97-111.