Results 31 to 40 of about 3,335 (132)
Permutability graphs of subgroups of some finite non-abelian groups
In this paper, we study the structure of the permutability graphs of subgroups, and the permutability graphs of non-normal subgroups of the following groups: the dihedral groups $D_n$, the generalized quaternion groups $Q_n$, the quasi-dihedral groups ...
Devi, P., Rajkumar, R.
core +1 more source
Fuzzy Eulerian and Fuzzy Hamiltonian Graphs with Their Applications
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
Note on Hamiltonicity of Basis Graphs of Even Delta‐Matroids
ABSTRACT We show that the basis graph of an even delta‐matroid is Hamiltonian if it has more than two vertices. More strongly, we prove that for two distinct edges e and f sharing a common end, it has a Hamiltonian cycle using e and avoiding f unless it has at most two vertices or it is a cycle of length at most four.
Donggyu Kim, Sang‐il Oum
wiley +1 more source
The different reflux hole areas. ABSTRACT To investigate the impact of the reflux hole area on the self‐priming performance of a self‐priming pump, this study innovatively established a circulating pipeline system that includes the self‐priming pump, water tank, and other components.
Ying‐Yu Ji +4 more
wiley +1 more source
On the wave turbulence theory of 2D gravity waves, I: Deterministic energy estimates
Abstract Our goal in this paper is to initiate the rigorous investigation of wave turbulence and derivation of wave kinetic equations (WKEs) for water waves models. This problem has received intense attention in recent years in the context of semilinear models, such as Schrödinger equations or multidimensional KdV‐type equations. However, our situation
Yu Deng +2 more
wiley +1 more source
Thoughts on Barnette's Conjecture [PDF]
We prove a new sufficient condition for a cubic 3-connected planar graph to be Hamiltonian. This condition is most easily described as a property of the dual graph. Let $G$ be a planar triangulation.
Alt, Helmut +3 more
core
In this paper, the concept of Total semirelib graph of a planar graph is introduced. Authors present a characterization of those graphs whose total semirelib graphs are planar, outer planar, Eulerian, hamiltonian with crossing number ...
Goudar, Venkanagouda, Prasad, Manjunath
core +2 more sources
On the Clean Graph of Commutative Artinian Rings
For a commutative Artinian ring R with unity, the clean graph Cl(R) is a graph with vertices in the form of an ordered pair (e, u), where e is an idempotent and u is a unit of ring R, respectively. Two distinct vertices (e, u) and (f, v) are adjacent in Cl(R) if and only if ef = fe = 0 or uv = vu = 1.
R. Singh +3 more
wiley +1 more source
The Hamiltonian index of a graph and its branch-bonds [PDF]
Let $G$ be an undirected and loopless finite graph that is not a path. The minimum $m$ such that the iterated line graph $L^m(G)$ is hamiltonian is called the hamiltonian index of $G,$ denoted by $h(G).$ A reduction method to determine the hamiltonian ...
Broersma, Haitze J. +4 more
core +1 more source
We initiate the study of a fundamental combinatorial problem: Given a capacitated graph $G=(V,E)$, find a shortest walk ("route") from a source $s\in V$ to a destination $t\in V$ that includes all vertices specified by a set $\mathscr{W}\subseteq V$: the
Amiri, Saeed Akhoondian +2 more
core +1 more source

