Results 121 to 130 of about 350 (134)
Eulerian and pancyclic zero-divisor graphs of ordered sets
AKCE International Journal of Graphs and CombinatoricsIn this paper, we determine when the zero-divisor graph of a special class of a finite pseudocomplemented poset is Eulerian. Also, we deal with Hamiltonian, vertex pancyclic, and edge pancyclic properties of the complement of a zero-divisor graph of ...
Vinayak Joshi, Nilesh Khandekar
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Traversing Graphs: The Eulerian and Hamiltonian Theme
2000This chapter deals with basic graph theoretical concepts and then focuses on special topics which are — in their applications — of relevance to theoretical and practical problems in OR. Therefore, this chapter is structured as follows: 1. Basics of Graph Theory. 2. Connectivity, Menger’s Theorem, the Splitting Lemma, and Factors.
openaire +1 more source
Journal of Molecular Structure: THEOCHEM, 1999
Abstract The model selected in order to assign a canonical name to a molecule in organic chemistry usually uses a graph theoretical edge set joining carbon nodes. For aliphatic compounds the most efficient type nomenclature involves the concatenation of Eulerian paths.
openaire +1 more source
Abstract The model selected in order to assign a canonical name to a molecule in organic chemistry usually uses a graph theoretical edge set joining carbon nodes. For aliphatic compounds the most efficient type nomenclature involves the concatenation of Eulerian paths.
openaire +1 more source
On the Complexity of Some Hamiltonian and Eulerian Problems in Edge-Colored Complete Graphs.
1991A. Benkouar +3 more
openaire +2 more sources
Supereulerian graphs with small circumference and 3-connected hamiltonian claw-free graphs
Discrete Applied Mathematics, 2016Baoyindureng Wu +2 more
exaly