Zobrazeno 1 - 10
of 186
pro vyhledávání: '"Baskoro, Edy Tri"'
Let $G=(V,E)$ be a finite, simple, and connected graph. The locating-chromatic number of a graph $G$ can be defined as the cardinality of a minimum resolving partition of the vertex set $V(G)$ such that all vertices have different coordinates and eve
Externí odkaz:
http://arxiv.org/abs/2408.06746
Autor:
Baskoro, Edy Tri, Obata, Nobuaki
Publikováno v:
Communications in Combinatorics and Optimization, 2024
The quadratic embedding constant (QEC) of a graph $G$ is a new numeric invariant, which is defined in terms of the distance matrix and is denoted by $\mathrm{QEC}(G)$. By observing graph structure of the maximal cliques (clique graph), we show that a
Externí odkaz:
http://arxiv.org/abs/2311.03342
An edge-locating coloring of a simple connected graph $G$ is a partition of its edge set into matchings such that the vertices of $G$ are distinguished by the distance to the matchings. The minimum number of the matchings of $G$ that admits an edge-l
Externí odkaz:
http://arxiv.org/abs/2310.05609
In 2019, Perondi and Carmelo determined the set multipartite Ramsey number of particular complete bipartite graphs by establishing a relationship between the set multipartite Ramsey number, Hadamard matrices, and strongly regular graphs, which is a b
Externí odkaz:
http://arxiv.org/abs/2307.09736
The locating chromatic number of a graph is the smallest integer $n$ such that there is a proper $n$-coloring $c$ and every vertex has a unique vector of distances to colors in $c$. We explore the necessary conditions and provide sufficient condition
Externí odkaz:
http://arxiv.org/abs/2104.04914
The locating-chromatic number of a graph $G$ is the smallest integer $n$, such that $G$ has a proper $n$-coloring $c$ and all vertices have different vectors of distances to the colors generated by $c$. We study the asymptotic value of the locating-c
Externí odkaz:
http://arxiv.org/abs/2001.00312
Autor:
Hafidh, Yusuf, Baskoro, Edy Tri
Chen et al. (2004) strongly conjectured that R(Tn,Wm)=2n-1 if the maximum degree of Tn is small and m is even. Related to the conjecture, it is interesting to know for which tree Tn, we have R(Tn,Wm) > 2n-1 for even m. In this paper, we find the Rams
Externí odkaz:
http://arxiv.org/abs/1912.05772
Autor:
Hafidh, Yusuf, Baskoro, Edy Tri
Some coloring algorithms gives an upper bound for the locating chromatic number of trees with all the vertices not in an end-path colored by only two colors. That means, a better coloring algorithm could be achieved by optimizing the number of colors
Externí odkaz:
http://arxiv.org/abs/1912.05775
Autor:
Baskoro, Edy Tri, Obata, Nobuaki
Publikováno v:
Electronic Journal of Graph Theory and Applications (EJGTA) Vol. 9 No. 2 (2021), 539 - 560
The QE constant of a finite connected graph $G$, denoted by $\mathrm{QEC}(G)$, is by definition the maximum of the quadratic function associated to the distance matrix on a certain sphere of codimension two. We prove that the QE constants of paths $P
Externí odkaz:
http://arxiv.org/abs/1904.08059