Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Ponciano, Vitor"'
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, vol. 25:2, Graph Theory (March 22, 2024) dmtcs:11423
In this corrigendum, we give a counterexample to Theorem 5.2 in "On the monophonic rank of a graph" [Discrete Math. Theor. Comput. Sci. 24:2 (2022) #3]. We also present a polynomial-time algorithm for computing the monophonic rank of a starlike graph
Externí odkaz:
http://arxiv.org/abs/2305.19277
Autor:
Dourado, Mitre C., Oliveira, Rodolfo A., Ponciano, Vitor, Queiróz, Alessandra B., Silva, Rômulo L. O.
Given a graph $G$ such that each vertex $v_i$ has a value $f(v_i)$, the expanded-clique graph $H$ is the graph where each vertex $v_i$ of $G$ becomes a clique $V_i$ of size $f(v_i)$ and for each edge $v_iv_j \in E(G)$, there is a vertex of $V_i$ adja
Externí odkaz:
http://arxiv.org/abs/2208.03411
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, vol. 24, no 2, Graph Theory (September 15, 2022) dmtcs:6835
A set of vertices $S$ of a graph $G$ is $monophonically \ convex$ if every induced path joining two vertices of $S$ is contained in $S$. The $monophonic \ convex \ hull$ of $S$, $\langle S \rangle$, is the smallest monophonically convex set containin
Externí odkaz:
http://arxiv.org/abs/2010.01365
Autor:
Ponciano, Vitor dos Santos
Publikováno v:
Biblioteca Digital de Teses e Dissertações da UFRRJUniversidade Federal Rural do Rio de JaneiroUFRRJ.
Submitted by Celso Magalhaes (celsomagalhaes@ufrrj.br) on 2018-08-28T12:21:13Z No. of bitstreams: 1 2017 - Victor dos Santos Ponciano.pdf: 551672 bytes, checksum: c01424f760ef08254a63d236b62f72c5 (MD5)
Made available in DSpace on 2018-08-28T12:2
Made available in DSpace on 2018-08-28T12:2
Externí odkaz:
https://tede.ufrrj.br/jspui/handle/jspui/2386
Publikováno v:
Discrete Mathematics & Theoretical Computer Science (DMTCS). 2022, Vol. 24 Issue 2, p1-14. 14p.
A set of vertices S of a graph G is monophonically convex if every induced path joining two vertices of S is contained in S. The monophonic convex hull of S, S , is the smallest monophonically convex set containing S. A set S is monophonic convexly i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::9653f05c9e887f92336d64b96ea0448e
https://hal.archives-ouvertes.fr/hal-02962105
https://hal.archives-ouvertes.fr/hal-02962105
Autor:
Ponciano, Vitor dos Santos
Publikováno v:
Biblioteca Digital de Teses e Dissertações da UFRRJ
Universidade Federal Rural do Rio de Janeiro (UFRRJ)
instacron:UFRRJ
Universidade Federal Rural do Rio de Janeiro (UFRRJ)
instacron:UFRRJ
Submitted by Celso Magalhaes (celsomagalhaes@ufrrj.br) on 2018-08-28T12:21:13Z No. of bitstreams: 1 2017 - Victor dos Santos Ponciano.pdf: 551672 bytes, checksum: c01424f760ef08254a63d236b62f72c5 (MD5) Made available in DSpace on 2018-08-28T12:21:15Z
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3056::afa7d05eb60b139cd7f1ed16de757bb0
https://tede.ufrrj.br/jspui/handle/jspui/2386
https://tede.ufrrj.br/jspui/handle/jspui/2386