Zobrazeno 1 - 10
of 147
pro vyhledávání: '"Sciriha Irene"'
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 42, Iss 4, Pp 1351-1382 (2022)
A signed graph has edge weights drawn from the set {+1, −1}, and is sign-balanced if it is equivalent to an unsigned graph under the operation of sign switching; otherwise it is sign-unbalanced. A nut graph has a one dimensional kernel of the 0-1 a
Externí odkaz:
https://doaj.org/article/221fe9ffabd3402a8d36b710857fa045
Autor:
Briffa Johann A., Sciriha Irene
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 40, Iss 2, Pp 435-450 (2020)
Twin vertices of a graph have the same open neighbourhood. If they are not adjacent, then they are called duplicates and contribute the eigenvalue zero to the adjacency matrix. Otherwise they are termed co-duplicates, when they contribute −1 as an
Externí odkaz:
https://doaj.org/article/bc712eb5c0c54fa6b158ef422bdc1fce
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 40, Iss 2, Pp 533-557 (2020)
A nut graph is a singular graph with one-dimensional kernel and corresponding eigenvector with no zero elements. The problem of determining the orders n for which d-regular nut graphs exist was recently posed by Gauci, Pisanski and Sciriha. These ord
Externí odkaz:
https://doaj.org/article/c9a0a205bff44ddf81793cf731aa28c2
Publikováno v:
Special Matrices, Vol 1, Iss 2013, Pp 28-41 (2013)
Externí odkaz:
https://doaj.org/article/638f89c44c454cfcaae1d22d980b90a7
Publikováno v:
Applicable Analysis and Discrete Mathematics, 2023 Oct 01. 17(2), 321-333.
Externí odkaz:
https://www.jstor.org/stable/27281414
Autor:
Sciriha, Irene, Borg, James L.
Publikováno v:
In Linear Algebra and Its Applications 15 July 2024 693:271-287
A signed graph has edge weights drawn from the set $\{+1,-1\}$, and is termed sign-balanced if it is equivalent to an unsigned graph under the operation of sign switching; otherwise it is called sign-unbalanced. A nut graph has a one dimensional kern
Externí odkaz:
http://arxiv.org/abs/2009.09018
The core vertex set of a graph is an invariant of the graph. It consists of those vertices associated with the non-zero entries of the nullspace vectors of a $\{0,1\}$-adjacency matrix. The remaining vertices of the graph form the core--forbidden ver
Externí odkaz:
http://arxiv.org/abs/2001.04710
A nut graph is a singular graph with one-dimensional kernel and corresponding eigenverctor with no zero elements. The problem of determining the orders $n$ for which $d$-regular nut graphs exist was recently posed by Gauci, Pisanski and Sciriha. Thes
Externí odkaz:
http://arxiv.org/abs/1908.11635
Autor:
Collins, Luke, Sciriha, Irene
The main eigenvalues of a graph $G$ are those eigenvalues of the $(0,1)$-adjacency matrix $\mathbf A$ having a corresponding eigenvector not orthogonal to $\mathbf j = (1,\dots,1)$. The CDC of a graph $G$ is the direct product $G\times K_2$. The main
Externí odkaz:
http://arxiv.org/abs/1906.05790