Zobrazeno 1 - 10
of 13 062
pro vyhledávání: '"A Basic"'
Autor:
Bašić, Nino, Damnjanović, Ivan
A nut graph is a nontrivial simple graph whose adjacency matrix contains a one-dimensional null space spanned by a vector without zero entries. Moreover, an $\ell$-circulant graph is a graph that admits a cyclic group of automorphisms having $\ell$ v
Externí odkaz:
http://arxiv.org/abs/2411.16904
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
Introducing Entity-Aspect Sentiment Triplet Extraction (EASTE), a novel Aspect-Based Sentiment Analysis (ABSA) task which extends Target-Aspect-Sentiment Detection (TASD) by separating aspect categories (e.g., food#quality) into pre-defined entities
Externí odkaz:
http://arxiv.org/abs/2407.04050
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
The traditional mathematical model for an impartial combinatorial game is defined recursively as a set of the options of the game, where the options are games themselves. We propose a model called gamegraph, together with its generalization rulegraph
Externí odkaz:
http://arxiv.org/abs/2312.00650
Battery management systems (BMS) are becoming increasingly important in the modern age, where clean energy awareness is getting more prominent. They are responsible for controlling large battery packs in modern electric vehicles. However, conventiona
Externí odkaz:
http://arxiv.org/abs/2311.12226
In modern systems that rely on the use of Battery Management Systems (BMS), longevity and the re-use of battery packs have always been important topics of discussion. These battery packs would be stored inside warehouses where they would need to be p
Externí odkaz:
http://arxiv.org/abs/2311.12006