Zobrazeno 1 - 10
of 69
pro vyhledávání: '"Bašić Nino"'
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
A nut graph is a simple graph for which the adjacency matrix has a single zero eigenvalue such that all non-zero kernel eigenvectors have no zero entry. It is known that infinitely many $d$-regular nut graphs exist for $3 \leq d \leq 12$ and for $d \
Externí odkaz:
http://arxiv.org/abs/2410.14063
Autor:
Bašić, Nino, Fowler, Patrick W.
A nut graph is a simple graph of order 2 or more for which the adjacency matrix has a single zero eigenvalue such that all non-zero kernel eigenvectors have no zero entry (i.e. are full). It is shown by construction that every finite group can be rep
Externí odkaz:
http://arxiv.org/abs/2405.04117
Publikováno v:
Electron. J. Combin. 31 (2024) #P2.31
A nut graph is a simple graph whose adjacency matrix has the eigenvalue zero with multiplicity one such that its corresponding eigenvector has no zero entries. It is known that there exist no cubic circulant nut graphs. A bicirculant (resp. tricircul
Externí odkaz:
http://arxiv.org/abs/2312.14884
Autor:
Alizadeh, Yaser, Bašić, Nino, Damnjanović, Ivan, Došlić, Tomislav, Pisanski, Tomaž, Stevanović, Dragan, Xu, Kexiang
A nonnegative integer $p$ is realizable by a graph-theoretical invariant $I$ if there exist a graph $G$ such that $I(G) = p$. The inverse problem for $I$ consists of finding all nonnegative integers $p$ realizable by $I$. In this paper, we consider a
Externí odkaz:
http://arxiv.org/abs/2312.13083
A nut graph is a simple graph for which the adjacency matrix has a single zero eigenvalue such that all non-zero kernel eigenvectors have no zero entry. If the isolated vertex is excluded as trivial, nut graphs have seven or more vertices; they are c
Externí odkaz:
http://arxiv.org/abs/2312.03149
Let $W(G)$ be the Wiener index of a graph $G$. We say that a vertex $v \in V(G)$ is a \v{S}olt\'es vertex in $G$ if $W(G - v) = W(G)$, i.e. the Wiener index does not change if the vertex $v$ is removed. In 1991, \v{S}olt\'es posed the problem of iden
Externí odkaz:
http://arxiv.org/abs/2303.11996
Autor:
Bašić, Nino, Fowler, Patrick W.
Altanisation (formation of the altan of a parent structure) originated in the chemical literature as a formal device for constructing generalised coronenes from smaller structures. The altan of graph $G$, denoted $\mathfrak{a}(G, H)$, depends on the
Externí odkaz:
http://arxiv.org/abs/2203.10071
Catacondensed benzenoids (those benzenoids having no carbon atom belonging to three hexagonal rings) form the simplest class of polycyclic aromatic hydrocarbons (PAH). They have a long history of study and are of wide chemical importance. In this pap
Externí odkaz:
http://arxiv.org/abs/2104.13290
A nut graph is a simple graph whose adjacency matrix is singular with $1$-dimensional kernel such that the corresponding eigenvector has no zero entries. In 2020, Fowler et al. characterised for each $d \in \{3,4,\ldots,11\}$ all values $n$ such that
Externí odkaz:
http://arxiv.org/abs/2102.04418