1. OAR@UM

Browsing by Author Farrugia, Alexander

Jump to: 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
or enter first few letters:  
Showing results 15 to 34 of 34 < previous 
Issue DateTitleAuthor(s)
2019Edge construction of molecular NSSDsFarrugia, Alexander
2001Foreword [The Collection, 4]Sciriha, Irene; Farrugia, Alexander
2002Foreword [The Collection, 5]Sciriha, Irene; Telenta, Tanya; Farrugia, Alexander
2021From nut graphs to molecular structure and conductivitySciriha, Irene; Farrugia, Alexander
2021Graphs having most of their eigenvalues shared by a vertex deleted subgraphFarrugia, Alexander
1991Ġenesi 1-3 : kif tifhimhom u kif tippreżentahom lit-tfal li qed jiehdu edukazzjoni primarjaFarrugia, Alexander
2018The increase in the resolvent energy of a graph due to the addition of a new edgeFarrugia, Alexander
2014The main eigenvalues and number of walks in self-complementary graphsFarrugia, Alexander; Sciriha, Irene
2016No chemical graph on more than two vertices is nuciferousSciriha, Irene; Farrugia, Alexander
2016Non-singular graphs with a singular deckFarrugia, Alexander; Gauci, John Baptist; Sciriha, Irene
2019On pseudo walk matricesFarrugia, Alexander
2016On strongly asymmetric and controllable primitive graphsFarrugia, Alexander
2013On the inverse of the adjacency matrix of a graphFarrugia, Alexander; Gauci, John Baptist; Sciriha, Irene
2015On the main eigenvalues of universal adjacency matrices and u-controllable graphsFarrugia, Alexander; Sciriha, Irene
2016On the spectra and walks of molecular and controllable graphsFarrugia, Alexander
2019The overgraphs of generalized cospectral controllable graphsFarrugia, Alexander
2020The rank of pseudo walk matrices : controllable and recalcitrant pairsFarrugia, Alexander
2020Spectral graph theory : from practice to theoryFarrugia, Alexander
2017Triangles in inverse NSSD graphsFarrugia, Alexander; Sciriha, Irene
2000Two simple proofsFarrugia, Alexander
Showing results 15 to 34 of 34 < previous