Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Metrose Metsidik"'
Autor:
Metrose Metsidik, Helin Gong
Publikováno v:
Journal of Mathematics, Vol 2021 (2021)
Semicartesian product is defined on the basis of two special bipartite graphs and labeling of their vertices, and it has a pleasing property that it is composed of hexagonal structures. In this study, we give two formulae to calculate separately the
Externí odkaz:
https://doaj.org/article/c269146e680e4e649eb63d9a0831ce81
Autor:
Metrose Metsidik
Publikováno v:
Symmetry, Vol 13, Iss 8, p 1475 (2021)
Eulerian and bipartite graph is a dual symmetric concept in Graph theory. It is well-known that a plane graph is Eulerian if and only if its geometric dual is bipartite. In this paper, we generalize the well-known result to embedded graphs and partia
Externí odkaz:
https://doaj.org/article/e6514c7c5d57450ba280c55034db33f7
Autor:
Helin Gong, Metrose Metsidik
Publikováno v:
Journal of Mathematics, Vol 2021 (2021)
Semicartesian product is defined on the basis of two special bipartite graphs and labeling of their vertices, and it has a pleasing property that it is composed of hexagonal structures. In this study, we give two formulae to calculate separately the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cb69b6e81c02a6bfefbba7d176e4bcb6
https://doi.org/10.1155/2021/6125053
https://doi.org/10.1155/2021/6125053
Autor:
Xian’an Jin, Metrose Metsidik
Publikováno v:
Journal of Graph Theory. 87:509-515
In the paper Combinatorica 33(2) (2013) 231–252, Huggett and Moffatt characterized all bipartite partial duals of a plane graph in terms of oriented circuits in its medial graph. An open problem posed in their paper is the characterization of Euler
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8f6e5b1f95049d3d8a9fb9a673a3d773
https://doi.org/10.1002/jgt.22171
https://doi.org/10.1002/jgt.22171
Publikováno v:
Discrete Mathematics. 343:111637
Huggett and Moffatt characterized all bipartite partial duals of a plane graph in terms of all-crossing directions of its medial graph. Then Metsidik and Jin characterized all Eulerian partial duals of a plane graph in terms of semi-crossing directio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3dbfa071a076aa33a005f61e83d166c5
https://doi.org/10.1016/j.disc.2019.111637
https://doi.org/10.1016/j.disc.2019.111637
Autor:
Metrose Metsidik
Publikováno v:
Journal of Mathematical Chemistry. 52:856-865
In this paper, we define a kind of new product graphs with hexagonal inner faces, called semi-cartesian products, so that they directly link with hexagonal system, e.g., the semi-cartesian product of an even cycle and a path is a zigzag polyhex nanot
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::758ef9bfe2a1644f40743f31d2552509
https://doi.org/10.1007/s10910-013-0297-6
https://doi.org/10.1007/s10910-013-0297-6
Autor:
Aishanjiang Wusuyin, Metrose Metsidik
Publikováno v:
Journal of Discrete Mathematical Sciences and Cryptography. 16:167-177
The Schultz index S(G) = Σ {u, v} ⊂ V(G) (degu + degu) d (u, v), where deg u is the degree of u and d (u, v) is the distance of two vertices u and v in G. In this paper, we calculate the Schultz indices of the F-sums graphs.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2555708a0aea097bb03aa6c2bbd87c29
https://doi.org/10.1080/09720529.2013.821776
https://doi.org/10.1080/09720529.2013.821776
Autor:
Metrose Metsidik, Elkin Vumar
Publikováno v:
Graphs and Combinatorics. 26:425-432
Let G be a connected graph. For $${x,y\in V(G)}$$with d(x, y) = 2, we define $${J(x,y)= \{u \in N(x)\cap N(y)\mid N[u] \subseteq N[x] \,{\cup}\,N[y] \}}$$and $${J'(x,y)= \{u \in N(x) \cap N(y)\,{\mid}\,{\rm if}\ v \in N(u){\setminus}(N[x] \,{\cup}\,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f10c305ac9d0e20435688e67839ed1af
https://doi.org/10.1007/s00373-010-0939-4
https://doi.org/10.1007/s00373-010-0939-4
Autor:
Metrose Metsidik, Elkin Vumar
Publikováno v:
Computers & Mathematics with Applications. 56(7):1741-1747
A graph is called bisplit if its vertex set can be partitioned into three stable sets I,Y and Z such that [email protected]?Z induces a complete bipartite graph (a biclique). In this paper, we investigate the edge vulnerability parameters of bisplit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::08b65f56965e1c02106272afa7887b9d