Zobrazeno 1 - 10
of 367
pro vyhledávání: '"Pisanski Tomaž"'
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
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
In this note we give a construction proving that the Gray graph, which is the smallest cubic semi-symmetric graph, is a unit-distance graph.
Comment: 7 pages, 5 figures
Comment: 7 pages, 5 figures
Externí odkaz:
http://arxiv.org/abs/2312.15336
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
When searching for small 4-configurations of points and lines, polycyclic configurations, in which every symmetry class of points and lines contains the same number of elements, have proved to be quite useful. In this paper we construct and prove the
Externí odkaz:
http://arxiv.org/abs/2309.12992
Publikováno v:
Applicable Analysis and Discrete Mathematics, 2023 Oct 01. 17(2), 321-333.
Externí odkaz:
https://www.jstor.org/stable/27281414
The "Gr\"unbaum Incidence Calculus" is the common name of a collection of operations introduced by Branko Gr\"unbaum to produce new $(n_{4})$ configurations from various input configurations. In a previous paper, we generalized two of these operation
Externí odkaz:
http://arxiv.org/abs/2204.11986
Publikováno v:
J. Algebra Appl. 23 (2024), no. 01, art. no 2450012
An \emph{antilattice} is an algebraic structure based on the same set of axioms as a lattice except that the two commutativity axioms for $\land$ and $\lor$ are replaced by anticommutative counterparts. In this paper we study certain classes of antil
Externí odkaz:
http://arxiv.org/abs/2112.07593