Zobrazeno 1 - 10
of 35
pro vyhledávání: '"A. A. Al-Rhayyel"'
We extend a result of Thistlethwaite [17, Theorem 1(iv)] on the structure of the Jones polynomial of alternating links to the wider class of quasi-alternating links. In particular, we prove that the Jones polynomial of any prime quasi-alternating lin
Externí odkaz:
http://arxiv.org/abs/2308.01064
Autor:
Qazaqzeh, Khaled, Al-Rhayyel, Ahmad
We apply the twisting technique that was first introduced in \cite{CK} and later generalized in \cite{QCQ} to obtain an infinite family of adequate, homogeneous or alternative links from a given adequate, homogeneous or alternative link, respectively
Externí odkaz:
http://arxiv.org/abs/2211.12269
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 19, Iss 3, Pp 282-286 (2022)
AbstractLet [Formula: see text] denote the class of non-bipartite graphs on n vertices containing no [Formula: see text]-graph and [Formula: see text] Let [Formula: see text] denote the class of non-bipartite Hamiltonian graphs on n vertices containi
Externí odkaz:
https://doaj.org/article/749c2eba1a7d4c7e8baf028c98f25a27
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Boletim da Sociedade Paranaense de Matemática, Vol 39, Iss 4 (2020)
For a set of graphs F , let H(n; F ) denote the class of non-bipartite Hamiltonian graphs on n vertices that does not contain any graph of F as a subgraph and h(n; F ) = max{E (G) : G E H(n; F )} where E (G) is the number of edges in G. In this paper
Externí odkaz:
https://doaj.org/article/9aed33be1ab249f1b8ecb7fdea80564a
Autor:
Gupta, Shreya, Jinka, Sanjay K. A., Khanal, Saugat, Bhavnani, Neha, Almashhori, Fayez, Lallo, Jason, Mathias, Amy, Al‐Rhayyel, Yasmine, Herman, Danielle, Holden, John G., Fleming, Sheila M., Raman, Priya
Publikováno v:
Journal of Neuroscience Research; Aug2023, Vol. 101 Issue 8, p1324-1344, 21p
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Boletim da Sociedade Paranaense de Matemática. 39:21-34
For a set of graphs F , let H(n; F ) denote the class of non-bipartite Hamiltonian graphs on n vertices that does not contain any graph of F as a subgraph and h(n; F ) = max{E (G) : G E H(n; F )} where E (G) is the number of edges in G. In this paper
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::25b6421893cd1d8162c22719d82ec414
https://doi.org/10.5269/bspm.41921
https://doi.org/10.5269/bspm.41921
Autor:
A. A. Al-Rhayyel
Publikováno v:
International Journal of Mathematics and Mathematical Sciences, Vol 19, Iss 2, Pp 411-414 (1996)
The basis number, b(G), of a graph G is defined to be the least integer k such that G has a k-fold basis for its cycle space. In this paper we determine the basis number of the direct product of paths and wheels. It is proved that P2∧Wn,is planar,
Externí odkaz:
https://doaj.org/article/7c6d03c3e8aa46a8a0373f5951df3a50
Autor:
Mohammad Shakhatreh, Ahmad Al-Rhayyel
Publikováno v:
International Journal of Mathematics and Mathematical Sciences, Vol 2006 (2006)
The basis number b(G) of a graph G is defined to be the least integer k such that G has a k-fold basis for its cycle space. In this note, we determine the basis number of the corona of graphs, in fact we prove that b(v∘T)=2 for any tree and any ver
Externí odkaz:
https://doaj.org/article/bfb88e57d7eb49f29199ebaae1eb9d30