Results 41 to 50 of about 81 (80)

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, Qin Xiaoxiao, Li Wen, Wang Xiaoling, Ma Haicheng   +4 more
doaj   +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  

Hamiltonicity of doubly semi-equivelar maps on the torus

Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica
There 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, Tiwari Anand Kumar, Kushwaha Seema   +2 more
doaj   +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, Fang Yi, Fan Yizheng, Cai Gaixiang   +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

Heavy Subgraphs, Stability and Hamiltonicity

Discussiones Mathematicae Graph Theory, 2017
Let G be a graph. Adopting the terminology of Broersma et al. and Čada, respectively, we say that G is 2-heavy if every induced claw (K1,3) of G contains two end-vertices each one has degree at least |V (G)|/2; and G is o-heavy if every induced claw of G
Li Binlong, Ning Bo
doaj   +1 more source

Eulerian $k$-dominating reconfiguration graphs [PDF]

Discrete Mathematics & Theoretical Computer Science
For a graph $G$, the vertices of the $k$-dominating graph, denoted $\mathcal{D}_k(G)$, correspond to the dominating sets of $G$ with cardinality at most $k$. Two vertices of $\mathcal{D}_k(G)$ are adjacent if and only if the corresponding dominating sets
M. E. Messinger, A. Porter
doaj   +1 more source

ALTERNATING AND SYMMETRIC GROUPS WITH EULERIAN GENERATING GRAPH

Forum of Mathematics, Sigma, 2017
Given a finite group $G$ , the generating graph $\unicode[STIX]{x1D6E4}(G)$
ANDREA LUCCHINI, CLAUDE MARION
doaj   +1 more source

Linear programming relaxations of the mixed postman problem”, Morfismos 9

, 2005
The mixed postman problem consists of finding a minimum cost tour of a connected mixed graph traversing all its vertices, edges, and arcs at least once.
Francisco Javier Zaragoza Martínez
core