Zobrazeno 1 - 10
of 319
pro vyhledávání: '"Severino V"'
Publikováno v:
Arabian Journal of Mathematics, Vol 9, Iss 2, Pp 345-355 (2020)
Abstract The graph $$G'$$ G ′ obtained from a graph G by identifying two nonadjacent vertices in G having at least one common neighbor is called a 1-fold of G. A sequence $$G_0, G_1, G_2, \ldots , G_k$$ G 0 , G 1 , G 2 , … , G k of graphs such th
Externí odkaz:
https://doaj.org/article/8ea41bd3ade745fd9cc4eb3b7cf168f9
Autor:
Gervacio, Severino V.
The score of a vertex $x$ in an oriented graph is defined to be its outdegree, \emph{i.e.}, the number of arcs with initial vertex $x$. The score sequence of an oriented graph is the sequence of all scores arranged in nondecreasing order. An oriented
Externí odkaz:
http://arxiv.org/abs/2102.01337
Autor:
Campeña, Francis Joseph H.1 francis.campena@dlsu.edu.ph, Gervacio, Severino V.1 severino.gervacio@dlsu.edu.ph
Publikováno v:
Proyecciones - Journal of Mathematics. Aug2023, Vol. 42 Issue 4, p957-965. 9p.
Autor:
Severino, V.1 vseverin@fagro.edu.uy, Arias-Sibillotte, M.1, Dogliotti, S.1, Frins, E.2, Gonzalez-Talice, J.1, Yuri, J. A.3
Publikováno v:
Advances in Horticultural Science. 2020, Vol. 34 Issue 4, p431-440. 10p.
Autor:
Campeña, Francis Joseph H.1 (AUTHOR) francis.campena@dlsu.edu.ph, Gervacio, Severino V.1 (AUTHOR)
Publikováno v:
Arabian Journal of Mathematics. Aug2020, Vol. 9 Issue 2, p345-355. 11p.
Publikováno v:
WIT Transactions on Ecology and the Environment.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b0de48a0baaa1cd122e35cecf484109b
https://doi.org/10.2495/wmei220011
https://doi.org/10.2495/wmei220011
Publikováno v:
Asian-European Journal of Mathematics. 16
The Cycle Graph [Formula: see text] of a graph [Formula: see text] is the edge intersection graph of all induced cycles of [Formula: see text]. In this paper, necessary and sufficient condition on [Formula: see text] such that [Formula: see text] is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::27b1e1439efbf593a0990dbcbfe6ecec
https://doi.org/10.1142/s1793557123500365
https://doi.org/10.1142/s1793557123500365
Autor:
Neil Mores Mame, Severino V. Gervacio
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 8, Iss 1, Pp 17-27 (2020)
Graphs considered in this paper are finite simple undirected graphs. Let G = (V(G), E(G)) be a graph with E(G) = {e1, e2,..., em}, for some positive integer m. The edge space of G, denoted by ℰ(G), is a vector space over the field ℤ2. The element
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::617125e8e7fbb5acc8ca4bfc962f2c4b
https://ejgta.org/index.php/ejgta/article/view/659
https://ejgta.org/index.php/ejgta/article/view/659
Publikováno v:
Arabian Journal of Mathematics, Vol 9, Iss 2, Pp 345-355 (2020)
The graph $$G'$$ G ′ obtained from a graph G by identifying two nonadjacent vertices in G having at least one common neighbor is called a 1-fold of G. A sequence $$G_0, G_1, G_2, \ldots , G_k$$ G 0 , G 1 , G 2 , … , G k of graphs such that $$G_0=
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::42d352aff6a4de6ca2753421ba4339e8
https://doaj.org/article/8ea41bd3ade745fd9cc4eb3b7cf168f9
https://doaj.org/article/8ea41bd3ade745fd9cc4eb3b7cf168f9