Results 41 to 50 of about 408 (81)
Note on Ideal Based Zero-Divisor Graph of a Commutative Ring
Discussiones Mathematicae - General Algebra and Applications, 2017 In this paper, we consider the ideal based zero divisor graph ΓI(R) of a commutative ring R. We discuss some graph theoretical properties of ΓI(R) in relation with zero divisor graph.
Mallika A., Kala R., Selvakumar K.
doaj +1 more source
Connected even factors in k-tree
Open Mathematics, 2020 A connected even [2,2s]{[}2,2s]-factor of a graph G is a connected factor with all vertices of degree i(i=2,4,…,2s)i(i=2,4,\ldots ,2s), where s≥1s\ge 1 is an integer. In this paper, we show that a k+1s+2\tfrac{k+1}{s+2}-tough k-tree has a connected even [
Li Yinkui +4 more
doaj +1 more source
Hamiltonicity of doubly semi-equivelar maps on the torus
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria MatematicaThere are 22 types of doubly semi-equivelar maps, with curvature 0, on the plane which provide infinitely many doubly semi-equivelar maps of respective types on the torus.
Singh Yogendra +2 more
doaj +1 more source
The Hamiltonian index of a graph and its branch-bonds [PDF]
, 2001 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
Spectral Radius and Hamiltonicity of Graphs
Discussiones Mathematicae Graph Theory, 2019 In this paper, we study the Hamiltonicity of graphs with large minimum degree. Firstly, we present some conditions for a simple graph to be Hamilton-connected and traceable from every vertex in terms of the spectral radius of the graph or its complement,
Yu Guidong +3 more
doaj +1 more source
Forbidden Pairs and (k,m)-Pancyclicity
Discussiones Mathematicae Graph Theory, 2017 A graph G on n vertices is said to be (k, m)-pancyclic if every set of k vertices in G is contained in a cycle of length r for each r ∈ {m, m+1, . . . , n}.
Crane Charles Brian
doaj +1 more source
On minimum degree conditions for supereulerian graphs [PDF]
, 1999 A graph is called supereulerian if it has a spanning closed trail. Let $G$ be a 2-edge-connected graph of order $n$ such that each minimal edge cut $E \subseteq E (G)$ with $|E| \le 3$ satisfies the property that each component of $G-E$ has order at ...
Broersma, H.J., Xiong, L.
core +2 more sources
, 1996 The concept of a line digraph is generalized to that of a directed path graph. The directed path graph $\overrightarrow P_k(D)$ of a digraph D is obtained by representing the directed paths on k vertices of D by vertices.
Broersma, Hajo, Li, Xueliang
core +1 more source
Dirac type condition and Hamiltonian graphs [PDF]
, 2011 2010 Mathematics Subject Classification: 05C38, 05C45.In 1952, Dirac introduced the degree type condition and proved that if G is a connected graph of order n і 3 such that its minimum degree satisfies d(G) і n/2, then G is Hamiltonian.
Zhao, Kewen
core
, 2015 We suggest a measure of "Eulerianness" of a finite directed graph and define a class of "coEulerian" graphs. These are the graphs whose Laplacian lattice is as large as possible.
Farrell, Matthew, Levine, Lionel
core +1 more source