Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Ivan Dler Ali"'
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 8, Iss 2, Pp 233-239 (2020)
For a nonabelian group G, the non-commuting graph Γ of G is defined as the graph with vertex-set G-Z(G), where Z(G) is the center of G, and two distinct vertices of Γ are adjacent if they do not commute in G. In this paper, we investigate the detou
Externí odkaz:
https://doaj.org/article/156cff969726419e8ff6fd07e56ce7d3
Autor:
Ivan Dler Ali, Herish O. Abdullah
Publikováno v:
Journal of Information and Optimization Sciences. 42:773-784
The restricted detour index of a connected graph G is equal to the sum of restricted detour distances of all unordered pairs of vertices of G. The restricted detour polynomial of graph G is defined...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::279717097bc30ea1f47d2968bffc1802
https://doi.org/10.1080/02522667.2020.1809116
https://doi.org/10.1080/02522667.2020.1809116
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 8, Iss 2, Pp 233-239 (2020)
For a nonabelian group G, the non-commuting graph $\Gamma_G$ of $G$ is defined as the graph with vertex set $G-Z(G)$, where $Z(G)$ is the center of $G$, and two distinct vertices of $\Gamma_G$ are adjacent if they do not commute in $G$. In this paper
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a7c33808217da417efd44cd9e658d8bb
https://ejgta.org/index.php/ejgta/article/view/789
https://ejgta.org/index.php/ejgta/article/view/789
Autor:
Ivan Dler Ali, Herish O. Abdullah
Publikováno v:
Al-Rafidain Journal of Computer Sciences and Mathematics, Vol 14, Iss 1, Pp 13-20 (2020)
The restricted detour distance D*(u,v) between two vertices u and v of a connected graph G is the length of a longest u - v path P in G such that = P. The main goal of this paper is to obtain the restricted detour polynomial of the theta graph. Moreo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a0ef1d00149caf58d1cbde5de863f923
https://doi.org/10.33899/csmj.2020.164664
https://doi.org/10.33899/csmj.2020.164664
Autor:
Herish O. Abdullah, Ivan Dler Ali
Publikováno v:
AIP Conference Proceedings.
The restricted detour distance D*(u, v) between two vertices u and v of G is the length of a longest u – v path P in G such that 〈V(P)〉 = P. The restricted detour polynomial of the graph G is denoted by D*(G; x) and defined as D*(G; x) = ∑u,v
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ca46d8e10a7b33c7017114cfd80cbe66
https://doi.org/10.1063/1.5004288
https://doi.org/10.1063/1.5004288