The following pages link to Irene Sciriha (Q189423):
Displaying 50 items.
- On eigenspaces of some compound signed graphs (Q314742) (← links)
- On the spectrum of threshold graphs (Q410640) (← links)
- Maximal and extremal singular graphs (Q690526) (← links)
- Graphs with a common eigenvalue deck (Q957997) (← links)
- Main eigenvalues and \((\kappa ,\tau )\)-regular sets (Q962129) (← links)
- (Q1377785) (redirect page) (← links)
- On the characteristic polynomial of homeomorphic images of a graph (Q1377786) (← links)
- On the construction of graphs of nullity one (Q1381857) (← links)
- Fast algorithms for indices of nested split graphs approximating real complex networks (Q1671330) (← links)
- Balanced centrality of networks (Q1727844) (← links)
- Trees with maximum nullity (Q1774973) (← links)
- Polynomial reconstruction and terminal vertices (Q1855397) (← links)
- On the inverse of the adjacency matrix of a graph (Q2017188) (← links)
- Preface: The second Malta conference in graph theory and combinatorics (Q2026312) (← links)
- Two-graphs and NSSDs: an algebraic approach (Q2026326) (← links)
- On singular signed graphs with nullspace spanned by a full vector: signed nut graphs (Q2158206) (← links)
- Nullspace vertex partition in graphs (Q2230734) (← links)
- On the displacement of eigenvalues when removing a twin vertex (Q2295997) (← links)
- Existence of regular nut graphs for degree at most 11 (Q2296003) (← links)
- A reduction procedure for the Colin de Verdière number of a graph (Q2309677) (← links)
- Controllability of undirected graphs (Q2451704) (← links)
- On nut and core singular fullerenes (Q2468006) (← links)
- Zero forcing sets and the minimum rank of graphs (Q2477541) (← links)
- The polynomial reconstruction problem: the first 50 years (Q2699914) (← links)
- (Q2708243) (← links)
- Coalescing Fiedler and core vertices (Q2828829) (← links)
- On the rank spread of graphs (Q2879639) (← links)
- (Q2895336) (← links)
- The main eigenvalues and number of walks in self-complementary graphs (Q2929475) (← links)
- Complete graphs with zero diagonal inverse (Q2958693) (← links)
- No chemical graph on more than two vertices is nuciferous (Q2958705) (← links)
- (Q2975315) (← links)
- (Q3144306) (← links)
- (Q3421940) (← links)
- On the Main Eigenvalues of Universal Adjacency Matrices and U-Controllable Graphs (Q3457773) (← links)
- A characterization of singular graphs (Q3497907) (← links)
- Coalesced and embedded nut graphs in singular graphs (Q3535839) (← links)
- Maximal core size in singular graphs (Q3552334) (← links)
- Some properties of the Hoffman-Singleton graph (Q3649401) (← links)
- (Q4228232) (← links)
- (Q4379759) (← links)
- (Q4443927) (← links)
- (Q4457011) (← links)
- (Q4489185) (← links)
- (Q4498324) (← links)
- (Q4529458) (← links)
- Spectra and structural polynomials of graphs of relevance to the theory of molecular conduction (Q4604528) (← links)
- Triangles in inverse NSSD graphs (Q5206294) (← links)
- The conductivity of superimposed key-graphs with a common one-dimensional adjacency nullspace (Q5225029) (← links)
- (Q5280065) (← links)
