Hamidreza Golmohammadi
YOU?
Author Swipe
View article: Total restrained coalitions in graphs
Total restrained coalitions in graphs Open
A vertex set in a graph without isolated vertices is a total restrained dominating set (TRD-set) if it is dominating, induces a subgraph without isolated vertices, and the vertices not in the set also induce a subgraph without isolated ver…
View article: Rheological behavior of MWCNT-SnO2/SAE50 hybrid nanolubricant: Experimental evaluation and viscosity prediction using optimized machine learning model
Rheological behavior of MWCNT-SnO2/SAE50 hybrid nanolubricant: Experimental evaluation and viscosity prediction using optimized machine learning model Open
The present paper investigated the rheological behavior and dynamic viscosity of SAE 50 lubricant in the presence of a novel mixture of MWCNT(25 %)/SnO2(75 %) nanopowders. In the first part of the research, three essential parameters, incl…
View article: Total restrained coalitions in graphs
Total restrained coalitions in graphs Open
A set $S\subseteq V$ in an isolate-free graph $G$ is a total restrained dominating set, abbreviated TRD-set, if every vertex in $V$ is adjacent to a vertex in $S$, and every vertex in $V\setminus S$ is adjacent to a vertex in $V\setminus S…
View article: On cubic graphs having the maximum coalition number
On cubic graphs having the maximum coalition number Open
View article: Strong coalitions in graphs
Strong coalitions in graphs Open
For a graph $G=(V,E)$, a set $D\subset V(G)$ is a strong dominating set of $G$, if for every vertex $x\in V (G)\setminus D$ there is a vertex $y\in D$ with $xy \in E(G)$ and $deg(x)\leq deg(y)$. A strong coalition consists of two disjoint …
View article: On cubic graphs having the maximal coalition number
On cubic graphs having the maximal coalition number Open
A coalition in a graph $G$ with vertex set $V$ consists of two disjoint sets $V_1, V_2\subset V$ such that neither $V_1$ nor $V_2$ is a dominating set, but the union $V_1\cup V_2$ is a dominating set in $G$. A partition of graph vertices i…
View article: On independent coalition in graphs and independent coalition graphs
On independent coalition in graphs and independent coalition graphs Open
An independent coalition in a graph G consists of two disjoint, indepen-either the set V i consists of a single dominating vertex of G, or V i forms an independent coalition with some other part V j .The independent coalition number IC(G) …
View article: Independent domination stability in graphs
Independent domination stability in graphs Open
A non-empty set $S\subseteq V (G)$ of the simple graph $G=(V(G),E(G))$ is an independent dominating set of $G$ if every vertex not in $S$ is adjacent with some vertex in $S$ and the vertices of $S$ are pairwise non-adjacent. The independen…
View article: Connected coalitions in graphs
Connected coalitions in graphs Open
Let G = (V, E) be a graph, and define a connected coalition as a pair of disjoint vertex sets U 1 and U 2 such that U 1 ∪ U 2 forms a connected dominating set, but neither U 1 nor U 2 individually forms a connected dominating set.A connect…
View article: Laboratory investigation of GO-SA-MWCNTs ternary hybrid nanoparticles efficacy on dynamic viscosity and wear properties of oil (5W30) and modeling based on machine learning
Laboratory investigation of GO-SA-MWCNTs ternary hybrid nanoparticles efficacy on dynamic viscosity and wear properties of oil (5W30) and modeling based on machine learning Open
In the present study, the properties of ternary hybrid nanofluid (THNF) of oil (5W30) - Graphene Oxide (GO)-Silica Aerogel (SA)-multi-walled carbon nanotubes (MWCNTs) in volume fractions ( $$\varphi )$$ of 0.3%, 0.6%, 0.9%, 1.2%, and 1.5%…
View article: Connected coalitions in graphs
Connected coalitions in graphs Open
The connected coalition in a graph $G=(V,E)$ consists of two disjoint sets of vertices $V_{1}$ and $V_{2}$, neither of which is a connected dominating set but whose union $V_{1}\cup V_{2}$, is a connected dominating set. A connected coalit…
View article: Introduction to total coalitions in graphs
Introduction to total coalitions in graphs Open
Let $G$ be a graph with vertex set $V$. Two disjoint sets $V_1, V_2\subseteq V$ are called a total coalition in $G$, if neither $V_1$ and $V_2$ is a total dominating set of $G$ but $V_1\cup V_2$ is a total dominating set. A total coalition…