Results 21 to 30 of about 350 (134)
EULERIAN AND HAMILTONIAN PROPERTIES OF GALLAI AND ANTI-GALLAI TOTAL GRAPHS [PDF]
Journal of the Indonesian Mathematical Society, 2015 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 ...
Garg, Pravin, Sinha, Deepa, Goyal, Shanu
openaire +1 more source
Relations and Notions amid Hamiltonicity and Eulerian Notions in Some Classes of Neutrosophic Graphs
, 2022 New setting is introduced to study Eulerian(Hamiltonian) neutrosophic path and n-Eulerian(Hamiltonian) neutrosophic path arising from finding and counting longest neutrosophic paths containing all edges (vertices) once.
Henry Garrett
core +1 more source
Catlin’s reduced graphs with small orders
AKCE International Journal of Graphs and Combinatorics, 2020 A graph is supereulerian if it has a spanning closed trail. Catlin in 1990 raised the problem of determining the reduced nonsupereulerian graphs with small orders, as such results are of particular importance in the study of Eulerian subgraphs and ...
Hong-Jian Lai +3 more
doaj +1 more source
Data Structures and their Planar Graph Layouts
Journal of Graph Algorithms and Applications, 2018 In a stack layout, also known as book embedding, the vertices of a graph are placed on a line and an edge is a data item that is pushed on the stack at the left vertex and removed at the right vertex.
Christopher Auer +4 more
doaj +1 more source
Connecting graphs with R-hypermodules via normal fuzzy subhypermodules [PDF]
Journal of HyperstructuresIn this paper, we analyze the connection between R-hypermodules and graphs by associating a graph with an R- hypermodule through a normal fuzzy subhypermodule.
Fatemeh Niyazi +2 more
doaj +1 more source
Group Colorability and Hamiltonian Properties of Graphs [PDF]
, 2011 The research of my dissertation was motivated by the conjecture of Thomassen that every 4-connected line graph is hamiltonian and by the conjecture of Matthews and Sumner that every 4-connected claw-free graph is hamiltonian. Towards the hamiltonian line
Li, Hao
core +1 more source
(Some of) the many uses of Eulerian graphs in graph theory (plus some applications) [PDF]
, 2001 In this survey type article, various connections between eulerian graphs and other graph properties such as being hamiltonian, nowhere-zero flows, the cycle-plus-triangles problem and problems derived from it, are demonstrated.
H. Fleischner, Fleischner, H.
core +1 more source
The Hamiltonian index of graphs [PDF]
, 2009 The Hamiltonian index of a graph G is defined as h ( G ) = min { m : L m ( G ) is Hamiltonian } . In this paper, using the reduction method of Catlin [P.A. Catlin, A reduction method to find spanning Eulerian subgraphs, J.
Tao, Zhi-Sui +3 more
core +1 more source
Fuzzy Eulerian and Fuzzy Hamiltonian Graphs with Their Applications
International Journal of Recent Technology and Engineering (IJRTE), 2019 In this article we discussed prominence of Fuzzy Eulerian and Fuzzy Hamiltonian graphs. Fuzzy logic is introduced to study the uncertainty of the event. In Fuzzy set theory we assign a membership value to each element of the set which ranges from 0 to 1. The earnest efforts of the researchers are perceivable in the relevant establishment of the subject
Abdul. Muneera +2 more
openaire +1 more source
, 2022 RESUMEN: El origen de la teoría de grafos se remonta al trabajo que realizó Euler en 1736, “Solutio problematis ad geometriam situs pertinentis”, donde determinó una condición necesaria para recorrer todas las aristas de un grafo pasando por cada una de ...
Arroyo Prieto, Marina
core