Results 51 to 60 of about 1,105 (90)
Distance-Local Rainbow Connection Number
Discussiones Mathematicae Graph Theory, 2022 Under an edge coloring (not necessarily proper), a rainbow path is a path whose edge colors are all distinct. The d-local rainbow connection number lrcd(G) (respectively, d-local strong rainbow connection number lsrcd(G)) is the smallest number of colors
Septyanto Fendy, Sugeng Kiki A.
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
Cyclic Permutations in Determining Crossing Numbers
Discussiones Mathematicae Graph Theory, 2022 The crossing number of a graph G is the minimum number of edge crossings over all drawings of G in the plane. Recently, the crossing numbers of join products of two graphs have been studied.
Klešč Marián, Staš Michal
doaj +1 more source
Cubic graphs with large circumference deficit [PDF]
, 2013 The circumference $c(G)$ of a graph $G$ is the length of a longest cycle. By exploiting our recent results on resistance of snarks, we construct infinite classes of cyclically $4$-, $5$- and $6$-edge-connected cubic graphs with circumference ratio $c(G)/|
Mazák, Ján, Máčajová, Edita
core
On Mann-type iteration method for a family of hemicontractive mappings in Hilbert spaces
, 2013 Let K be a compact convex subset of a real Hilbert space H and Ti:K→K, i=1,2,…,k, be a family of continuous hemicontractive mappings. Let αn,βni∈[0,1] be such that αn+∑i=1kβni=1 and satisfying {αn},βni⊂[δ,1−δ] for some δ∈(0,1), i=1,2,…,k.
N. Hussain, L. Ciric, Y. Cho, A. Rafiq
semanticscholar +1 more source
Dense Arbitrarily Partitionable Graphs
Discussiones Mathematicae Graph Theory, 2016 A graph G of order n is called arbitrarily partitionable (AP for short) if, for every sequence (n1, . . . , nk) of positive integers with n1 + ⋯ + nk = n, there exists a partition (V1, . . .
Kalinowski Rafał +3 more
doaj +1 more source
Enumeration of weighted paths on a digraph and block hook determinant
Special Matrices, 2021 In this article, we evaluate determinants of “block hook” matrices, which are block matrices consist of hook matrices. In particular, we deduce that the determinant of a block hook matrix factorizes nicely.
Bera Sudip
doaj +1 more source
Bounds on the number of closed walks in a graph and its applications
, 2014 Using graph-theoretical techniques, we establish an inequality regarding the number of walks and closed walks in a graph. This inequality yields several upper bounds for the number of closed walks in a graph in terms of the number of vertices, number of ...
Xiaodan Chen, Jianguo Qian
semanticscholar +1 more source
On the Number of Disjoint 4-Cycles in Regular Tournaments
Discussiones Mathematicae Graph Theory, 2018 In this paper, we prove that for an integer r ≥ 1, every regular tournament T of degree 3r − 1 contains at least 2116r-103${{21} \over {16}}r - {{10} \over 3}$ disjoint directed 4-cycles. Our result is an improvement of Lichiardopol’s theorem when taking
Ma Fuhong, Yan Jin
doaj +1 more source
On the n-Partite Tournaments with Exactly n − m + 1 Cycles of Length m
Discussiones Mathematicae Graph Theory, 2021 Gutin and Rafiey [Multipartite tournaments with small number of cycles, Australas J. Combin. 34 (2006) 17–21] raised the following two problems: (1) Let m ∈ {3, 4, . . ., n}.
Guo Qiaoping, Meng Wei
doaj +1 more source