Zobrazeno 1 - 10
of 230
pro vyhledávání: '"Miklavič, Štefko"'
The $Q$-polynomial property is an algebraic property of distance-regular graphs, that was introduced by Delsarte in his study of coding theory. Many distance-regular graphs admit the $Q$-polynomial property. Only recently the $Q$-polynomial property
Externí odkaz:
http://arxiv.org/abs/2404.12510
Let $\Gamma=(X,\mathcal{R})$ denote a finite, simple, connected, and undirected non-bipartite graph with vertex set $X$ and edge set $\mathcal{R}$. Fix a vertex $x \in X$, and define $\mathcal{R}_f = \mathcal{R} \setminus \{yz \mid \partial(x,y) = \p
Externí odkaz:
http://arxiv.org/abs/2308.16679
Let $\Gamma=(X,\mathcal{R})$ denote a finite, simple, connected, and undirected non-bipartite graph with vertex set $X$ and edge set $\mathcal{R}$. Fix a vertex $x \in X$, and define $\mathcal{R}_f = \mathcal{R} \setminus \{yz \mid \partial(x,y) = \p
Externí odkaz:
http://arxiv.org/abs/2305.08937
Autor:
Fernández, Blas, Maleki, Roghayeh, Miklavič, Štefko, Razafimahatratra, Andriaherimanana Sarobidy
Let $\Gamma=(V,E)$ be a graph of order $n$. A {\em closed distance magic labeling} of $\Gamma$ is a bijection $\ell : V \to \{1,2, \ldots, n\}$ for which there exists a positive integer $r$ such that $\sum_{x \in N[u]} \ell(x) = r$ for all vertices $
Externí odkaz:
http://arxiv.org/abs/2212.12441
Do\v{s}li\'{c} et al. defined the Mostar index of a graph $G$ as $Mo(G)=\sum\limits_{uv\in E(G)}|n_G(u,v)-n_G(v,u)|$, where, for an edge $uv$ of $G$, the term $n_G(u,v)$ denotes the number of vertices of $G$ that have a smaller distance in $G$ to $u$
Externí odkaz:
http://arxiv.org/abs/2211.06682
Do\v{s}li\'{c} et al.~defined the Mostar index of a graph $G$ as $\sum\limits_{uv\in E(G)}|n_G(u,v)-n_G(v,u)|$, where, for an edge $uv$ of $G$, the term $n_G(u,v)$ denotes the number of vertices of $G$ that have a smaller distance in $G$ to $u$ than
Externí odkaz:
http://arxiv.org/abs/2210.03399
Autor:
Miklavič, Štefko, Šparl, Primož
Publikováno v:
Published in Discrete Applied Mathematics, Volume 329, 2023, Pages 35-48
A graph $\Gamma = (V,E)$ of order $n$ is {\em distance magic} if it admits a bijective labeling $\ell \colon V \to \{1,2, \ldots, n\}$ of its vertices for which there exists a positive integer $\kappa$ such that $\sum_{u \in N(v)} \ell(u) = \kappa$ f
Externí odkaz:
http://arxiv.org/abs/2203.09856
For a permutation group $G$ acting on a set $V$, a subset $I$ of $G$ is said to be an intersecting set if for every pair of elements $g,h\in I$ there exists $v \in V$ such that $g(v) = h(v)$. The intersection density $\rho(G)$ of a transitive permuta
Externí odkaz:
http://arxiv.org/abs/2108.03943
Autor:
Hujdurović, Ademir, Kutnar, Klavdija, Kuzma, Bojan, Marušič, Dragan, Miklavič, Štefko, Orel, Marko
Publikováno v:
Finite Fields and Their Applications, Volume 78, 2022
Two elements $g$ and $h$ of a permutation group $G$ acting on a set $V$ are said to be intersecting if $g(v) = h(v)$ for some $v \in V$. More generally, a subset ${\cal F}$ of $G$ is an intersecting set if every pair of elements of ${\cal F}$ is inte
Externí odkaz:
http://arxiv.org/abs/2107.09327
A connected graph $\G$ is called {\em nicely distance--balanced}, whenever there exists a positive integer $\gamma=\gamma(\G)$, such that for any two adjacent vertices $u,v$ of $\G$ there are exactly $\gamma$ vertices of $\G$ which are closer to $u$
Externí odkaz:
http://arxiv.org/abs/2105.10655