Results 21 to 30 of about 3,335 (132)

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

Akram B. Attar EXTENSIBILITY OF GRAPHS

مجلة علوم ذي قار, 2019
In this paper, the concepts of extension of a graph(digraph) and the extensible class of graphs(digraphs) have been introduced. The class of connected graphs as well as the class of Hamiltonian graphs which are extensible classes have also been proved ...
Akram Attar
doaj   +4 more sources

Connecting graphs with R-hypermodules via normal fuzzy subhypermodules [PDF]

Journal of Hyperstructures
In 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, Razieh Mahjoob, Reza Ameri   +2 more
doaj   +1 more source

Hamiltonian problems in edge-colored complete graphs and eulerian cycles in edge-colored graphs : some complexity results [PDF]

RAIRO - Operations Research, 1996
Summary: In an edge-colored graph, we say that a path (cycle) is alternating if it has length at least 2 (3) and if any 2 adjacent edges of this path (cycle) have different colors. We give efficient algorithms for finding alternating factors with a minimum number of cycles and then, by using this result, we obtain polynomial algorithms for finding ...
Benkouar, A., Manoussakis, Yannis, Paschos, Vangelis, Saad, Rachid   +3 more
openaire   +2 more sources

Decomposing tournaments into paths

Proceedings of the London Mathematical Society, Volume 121, Issue 2, Page 426-461, August 2020., 2020
Abstract We consider a generalisation of Kelly's conjecture which is due to Alspach, Mason, and Pullman from 1976. Kelly's conjecture states that every regular tournament has an edge decomposition into Hamilton cycles, and this was proved by Kühn and Osthus for large tournaments. The conjecture of Alspach, Mason, and Pullman asks for the minimum number
Allan Lo, Viresh Patel, Jozef Skokan, John Talbot   +3 more
wiley   +1 more source

Efficient decoupling schemes with bounded controls based on Eulerian orthogonal arrays [PDF]

, 2004
The task of decoupling, i.e., removing unwanted interactions in a system Hamiltonian and/or couplings with an environment (decoherence), plays an important role in controlling quantum systems.
A. S. Hedayat, J. A. Jones, L. Viola, P. Wocjan, Pawel Wocjan, R. R. Ernst   +5 more
core   +2 more sources

Parameterized Edge Hamiltonicity

, 2014
We study the parameterized complexity of the classical Edge Hamiltonian Path problem and give several fixed-parameter tractability results. First, we settle an open question of Demaine et al.
AA Bertossi, B Courcelle, B Courcelle, B Courcelle, DG Corneil, ED Demaine, F Gurski, F Gurski, F Harary, FV Fomin, G Chartrand, H-J Lai, HL Bodlaender, I Razgon, J Flum, L Clark, P Dey, P Hliněnỳ, PA Catlin, R Niedermeier, RA Brualdi, RG Downey, S-I Oum, T-H Lai, TH Cormen, W Espelage, Z Ryjácek, Z-H Chen   +27 more
core   +1 more source

Conjecture jackson dalam subgrapheuler [PDF]

, 1998
ABSTRAK Conjecture Jackson menyatakan bahwa jika G .merupakan graph 2-garis terhubung, maka G mempunyai subgraph euler H dengan IV(H)I ?. 2, sedemikian sehingga untuk setiap komponen F dari G-V(H) terdapat aebanyak-banyaknya 3 garis antara F dan H ...
Sukiyati , Sukiyati
core  

GLONET: Mercator's End‐to‐End Neural Global Ocean Forecasting System

Journal of Geophysical Research: Machine Learning and Computation, Volume 2, Issue 3, September 2025.
Abstract Accurate ocean forecasting is crucial in different areas ranging from science to decision making. Recent advancements in data‐driven models have shown significant promise, particularly in weather forecasting community, but yet no data‐driven approaches have matched the accuracy and the scalability of traditional global ocean forecasting ...
Anass El Aouni, Quentin Gaudel, Charly Regnier, Simon Van Gennip, Olivier Le Galloudec, Marie Drevillon, Yann Drillet, Jean‐Michel Lellouche   +7 more
wiley   +1 more source

IDENTIFY CONNECTIVITY GRAPH USING A MODIFIED PRÜFER’S ALGORITHM LABELLING TREES

Jurnal Natural, 2014
Connectivity of graph easily can be given when we see it with the bare of eyes, but needs an algorithm that can assure the connectivity in computerization.
Al Aiyub, Mahyus Ihsan, Rahma Zuhra
doaj   +2 more sources