Results 41 to 50 of about 80 (79)

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

, 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  

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

Laplacian spectral radius and some Hamiltonian properties of graphs, manuscript [PDF]

, 2014
. Using upper bounds for the spectral radius of graphs established by Cao, we in this note present sufficient conditions which are based on the spectral radius for some Hamiltonian properties of graphs. Keywords: Spectral radius, Hamiltonian property AMS
Rao Li
core  

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

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

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  

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

Hamiltonian properties of locally connnected graphs with bounded vertex degree [PDF]

, 2009
We consider the existence of hamiltonian cycles for locally connected graphs with a bounded vertex degree. For a graph G, let ¢(G) and ±(G) denote the maximum and minimum vertex degrees, respectively.
Strusevich, Vitaly A., Gordon, Valery S., Orlovich, Yu. L., Potts, Chris N.   +3 more
core  

Direct Message Delivery Among Processors with Limited Capacity [PDF]

, 2007
Processors with finite storage capacities send and receive messages among one another, with each message going directly from its sender to its recipient.
Devadatta M. Kulkarni, Jon Froemke, Jerrold W. Grossman   +2 more
core