EULERIAN AND HAMILTONIAN PROPERTIES OF GALLAI AND ANTI-GALLAI TOTAL GRAPHS

Pravin Garg, Deepa Sinha, Shanu Goyal

Abstract


Let $G = (V, E)$ be a graph. The \textit{Gallai total graph} $\Gamma_T(G)$ of $G$ is the graph, where $V(\Gamma_T(G))=V \cup E$ and $uv \in E(\Gamma_T(G))$ if and only if

\begin{itemize}

\item[$(i)$] $u$ and $v$ are adjacent vertices in $G$, or

\item[$(ii)$] $u$ is incident to $v$ or $v$ is incident to $u$ in $G$, or

\item[$(iii)$] $u$ and $v$ are adjacent edges in $G$ which do not span a triangle in $G$.

\end{itemize}

 

The \textit{anti-Gallai total graph} $\Delta_T(G)$ of $G$ is the graph, where $V(\Delta_T(G))=V \cup E$ and $uv \in E(\Delta_T(G))$ if and only if

\begin{itemize}

\item[$(i)$] $u$ and $v$ are adjacent vertices in $G$, or

\item[$(ii)$] $u$ is incident to $v$ or $v$ is incident to $u$ in $G$, or

\item[$(iii)$] $u$ and $v$ are adjacent edges in $G$ and lie on a same triangle in $G$.

\end{itemize}

 

In this paper, we discuss Eulerian and Hamiltonian properties of Gallai and anti-Gallai total graphs.

DOI : http://dx.doi.org/10.22342/jims.21.2.230.105-116


Keywords


Euler graph; Hamiltonian graph; Gallai total graph; anti-Gallai total graph

Full Text:

PDF


DOI: https://doi.org/10.22342/jims.21.2.230.105-116

Refbacks

  • There are currently no refbacks.



Journal of the Indonesian Mathematical Society
Mathematics Department, Universitas Gadjah Mada
Senolowo, Sinduadi, Mlati, Sleman Regency, Special Region of Yogyakarta 55281, Telp. (0274) 552243
Email: jims.indoms@gmail.com


p-ISSN: 2086-8952 | e-ISSN: 2460-0245


Journal of the Indonesian Mathematical Society is licensed under a Creative Commons Attribution 4.0 International License

web statistics
View My Stats