Zobrazeno 1 - 9
of 9
pro vyhledávání: '"M. H. Akhbari"'
Publikováno v:
Lobachevskii Journal of Mathematics. 42:751-759
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::823b534b2358274213ac22a43c66adb5
https://doi.org/10.1134/s1995080221040156
https://doi.org/10.1134/s1995080221040156
Publikováno v:
Journal of Applied Mathematics and Computing. 63:295-310
Let G be a graph with n vertices and m edges. The edges energy is defined as the sum of the absolute values of eigenvalues of the adjacency matrix of line graph of G. In this paper, the minimum edge dominating energy of the graph G is introduced and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::575f516350d93214a5055e982d7df2c9
https://doi.org/10.1007/s12190-020-01318-7
https://doi.org/10.1007/s12190-020-01318-7
Autor:
Azam Pourghasemi, M. H. Akhbari
Publikováno v:
Journal of Ecophysiology and Occupational Health. 18:18-23
The energy plays a significant role in human life and almost it is not possible to continue the life without it. This is why energy has got a key role in our national and international policies and has shaped up patterns of rivalry, cooperation, conf
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e7e44c127d92f9e689b3636f752f7a77
https://doi.org/10.18311/jeoh/2018/21369
https://doi.org/10.18311/jeoh/2018/21369
Autor:
M. H. Akhbari, V.R. Kulli
Publikováno v:
Annals of Pure and Applied Mathematics. 16:429-436
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::656003dcdb6413ff18c7445d291ad5cf
https://doi.org/10.22457/apam.v16n2a20
https://doi.org/10.22457/apam.v16n2a20
Autor:
Feizal Yusof, M. H. Akhbari, Abolfazl Akbari, Milad Heidari, Azil Bahari Alias, Erfan Mohammadian, Zahrapanah Razaviyan, Fateme Movahedi
Publikováno v:
Scipedia Open Access
Scipedia SL
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Scipedia SL
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
A trimaran is a multihull vessel designed to reduce wave-making resistances at high speeds. Optimization of the hull shape increases hull efficiency and speed of a vessel. The behavior of a ship is generally analyzed through numerical methods to save
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2cdf7f413f2be30bf6f4c513c7cbbecd
https://www.scipedia.com/public/Heidari_et_al_2019a
https://www.scipedia.com/public/Heidari_et_al_2019a
Autor:
Nader Jafari Rad, M. H. Akhbari
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 4, Iss 1, Pp 111-118 (2016)
A set $D$ of vertices in a graph $G=(V,E)$ is a total dominatingset if every vertex of $G$ is adjacent to some vertex in $D$. Atotal dominating set $D$ of $G$ is said to be weak if everyvertex $v\in V-D$ is adjacent to a vertex $u\in D$ such that$d_{
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3bd6f312c809d57ec4324e405b38855e
https://ejgta.org/index.php/ejgta/article/view/141
https://ejgta.org/index.php/ejgta/article/view/141
In this paper, we obtain the domination number, the total domination number and the independent domination number in the neighborhood graph. We also investigate these parameters of domination on the join and the corona of two neighborhood graphs.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4cc39eb6ea2dfebd7f608e68ad9eda64
Publikováno v:
Asian-European Journal of Mathematics. 12:1950036
Let [Formula: see text] be a simple graph. A set [Formula: see text] is a doubly connected dominating set of [Formula: see text] if it is a dominating set and both induced subgraphs [Formula: see text] and [Formula: see text] are connected. In this p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e714720201832c4b394d65dc6e67c137
https://doi.org/10.1142/s1793557119500360
https://doi.org/10.1142/s1793557119500360
Publikováno v:
Journal of Combinatorial Optimization. 26:10-18
A set S of vertices of a graph G is an outer-connected dominating set if every vertex not in S is adjacent to some vertex in S and the subgraph induced by V?S is connected. The outer-connected domination number $\widetilde{\gamma}_{c}(G)$ is the mini
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7babd7d91bbd5d8402082aac598a5d57
https://doi.org/10.1007/s10878-011-9427-x
https://doi.org/10.1007/s10878-011-9427-x