Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Kamyar Mirzavaziri"'
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 38, Iss 1, Pp 27-37 (2018)
A Graph is called 2-self-centered if its diameter and radius both equal to 2. In this paper, we begin characterizing these graphs by characterizing edge-maximal 2-self-centered graphs via their complements. Then we split characterizing edge-minimal 2
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a9318f6063a44dbdfeabecb4e8973023
https://doaj.org/article/3f939930038143c2bf9295345c9b7bf9
https://doaj.org/article/3f939930038143c2bf9295345c9b7bf9
Publikováno v:
Open Journal of Discrete Mathematics. :99-104
Let n be a positive integer. A permutation a of the symmetric group of permutations of is called a derangement if for each . Suppose that x and y are two arbitrary permutations of . We say that a permutation a is a double derangement with respect to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::be4a2157ced9d17d1b3e4f8f4e5e94ed
https://doi.org/10.4236/ojdm.2016.62010
https://doi.org/10.4236/ojdm.2016.62010
Publikováno v:
Creative Mathematics and Informatics. 24:89-95
In this paper we extend the notion of the binomial coefficient nk into a new notion [G/k], where [G] is an unlabelled graph with n vertices and 0 6 k 6 n. We call [G/k] as the graph binomial coefficient and a version of the graph binomial expansion i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::82b3f5927d3d97a788080d70057f833c
https://doi.org/10.37193/cmi.2015.01.08
https://doi.org/10.37193/cmi.2015.01.08
Autor:
MOHAMMAD HADI SHEKARRIZ1 mh.shekarriz@mail.um.ac.ir, MADJID MIRZAVAZIRI1 mirzavaziri@um.ac.ir, KAMYAR MIRZAVAZIRI2 mirzavaziri@gmail.com
Publikováno v:
Discussiones Mathematicae: Graph Theory. 2018, Vol. 38 Issue 1, p27-37. 11p. 2 Diagrams.