Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Omid Khormali"'
Autor:
Omid Khormali
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 16, Iss 2, Pp 172-181 (2019)
The distinguishing number of graphs is generalized in two directions by Cheng and Cowen (local distinguishing number) and Collins and Trenk (Distinguishing chromatic number). In this paper, we define and study the local distinguishing chromatic numbe
Externí odkaz:
https://doaj.org/article/13af67e8f4e4426d81729d501ef3fa4b
Autor:
Omid Khormali
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 5, Iss 1, Pp 83-93 (2017)
For any $k \in \mathbb{N}$, the $k-$distance graph $D^{k}G$ has the same vertex set of $G$, and two vertices of $D^{k}G$ are adjacent if they are exactly distance $k$ apart in the original graph $G$. In this paper, we consider the connectivity of $D^
Externí odkaz:
https://doaj.org/article/36d9476cdc644e2492bd4884ba3d1f04
Publikováno v:
Statistics & Probability Letters. 144:57-62
We introduce modeling approaches for quantifying the spatiotemporal location and characteristics of clusters with application to the 1993 Jeffrey pine beetle (JPB) forest epidemic attack.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bc17d1f01b0ab0695bd3a57d5a9e7f02
https://doi.org/10.1016/j.spl.2018.07.001
https://doi.org/10.1016/j.spl.2018.07.001
Autor:
Omid Khormali, Cory Palmer
Publikováno v:
European Journal of Combinatorics. 102:103506
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9dc5258118db0c1818eb50c122308d1e
https://doi.org/10.1016/j.ejc.2022.103506
https://doi.org/10.1016/j.ejc.2022.103506
Autor:
Danny Rorabaugh, Anton Bernshteyn, Andrew J. Uzzell, Ryan Martin, Jonathan Rollin, Omid Khormali, Songling Shan
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 40, Iss 3, Pp 795-806 (2020)
An (r − 1, 1)-coloring of an r-regular graph G is an edge coloring (with arbitrarily many colors) such that each vertex is incident to r − 1 edges of one color and 1 edge of a different color. In this paper, we completely characterize all 4-regul
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9a4c4d8344a57e1dd38d26937e86bc70
https://doi.org/10.7151/dmgt.2149
https://doi.org/10.7151/dmgt.2149
Autor:
Omid Khormali, Ali Kazemipour
Publikováno v:
Journal of Computational and Theoretical Nanoscience. 9:456-460
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6ef3595ac0ec0e77b152a93da18b33c0
https://doi.org/10.1166/jctn.2012.2046
https://doi.org/10.1166/jctn.2012.2046
Publikováno v:
Journal of Computational and Theoretical Nanoscience. 8:133-138
The ordinary (vertex) version of Wiener number is oldest number which defined on distances between vertices of a graph.1 This number is famous the first and important topological index in chemistry. So many interesting works has been done on vertex-W
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c8bee40486c49b01d44f979ff0def761
https://doi.org/10.1166/jctn.2011.1670
https://doi.org/10.1166/jctn.2011.1670
Publikováno v:
Journal of Linear and Topological Algebra, Vol 2, Iss 2 (2014)
The edge detour index polynomials were recently introduced for computing the edge detour indices. In this paper we find relations among edge detour polynomials for the 2-dimensional graph of $TUC_4C_8(S)$ in a Euclidean plane and $TUC_4C_
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::16e4871adf988a7793c6fb0ca683905e
http://jlta.iauctb.ac.ir/index.php/jlta/article/view/33
http://jlta.iauctb.ac.ir/index.php/jlta/article/view/33