بحث بسيط
السجلات المعروضة 1 -- 9 من 9
Some remarks concerning D∗-metric spaces
(
International Scientific Research Publications
, 2020 , Article)
In [S. Sedghi, N. Shobe, H. Y. Zhou, Fixed Point Theory Appl., 2007 (2007), 13 pages], Sedghi et al. introduced the notion of D∗ -metric space and in [S. Sedghi, N. Shobe, A. Aliouche, Mat. Vesnik, 64 (2012), 258–266] the ...
Edge Maximal C2k+1-edge Disjoint Free Graphs
(
University of Zielona Gora
, 2012 , Article)
For two positive integers r and s, G(n;r,s) denotes to the class of graphs on n vertices containing no r of s-edge disjoint cycles and f(n;r,s) = max{E(G):G ∈ G(n;r,s)}. In this paper, for integers r ≥ 2 and k ≥ 1, we ...
The basis number of the strong product of paths and cycles with bipartite graphs
(
Central Missouri State University
, 2007 , Article)
The basis number of a graph G is defined to be the least integer d such that there is a basis B of the cycle space of G such that each edge of G is contained in at most d members of B. MacLane [13] proved that a graph G ...
On minimum cycle bases of the wreath product of wheels with stars
(
Zenodo
, 2010 , Article)
The length of a cycle basis of a graph is the sum of the lengths of its elements. A minimum cycle basis is a cycle basis with minimum length. In this work, a construction of a minimum cycle basis for the wreath product of ...
The cycle-complete graph Ramsey number r ( C 8 , K 8 )
(
Tokyo University of Science
, 2007 , Article)
The cycle-complete graph Ramsey number
r
(
C
m
,
K
n
)
is the smallest integer
N
such that every graph
G
of order
N
contains a cycle
C
m
on
m
vertices or has independent number
α
(
G
)
≥
n
. ...
The theta-complete graph Ramsey number r(θk, K5); k = 7, 8, 9
(
Forum-Editrice Universitaria Udinese SRL
, 2021 , Article)
Finding the Ramsey number is an important problem of the well-known
family of the combinatorial problems in Ramsey theory. In this work, we investigate
the Ramsey number r(θs, K5) for s = 7, 8, 9 where θs is the set of ...
The ramsey number for theta graph versus a clique of order three and four
(
University of Zielona Gora
, 2014 , Article)
For any two graphs F1 and F2, the graph Ramsey number r(F1, F2) is
the smallest positive integer N with the property that every graph on at
least N vertices contains F1 or its complement contains F2 as a subgraph.
In ...
New solitary wave and computational solitons for Kundu-Eckhaus equation
(
Elsevier
, 2022 , Article)
The goal of this research is to find novel optical solutions to the Kundu-Eckhaus equation, which possess crucial roles in the field of nonlinear optics. A collective variable (CV) strategy is adopted to solve governing ...
The cycle-complete graph Ramsey number r(C6,K8)≤38
(
Tokyo University of Science
, 2008 , Article)
The cycle-complete graph Ramsey number
r
(
C
m
,
K
n
)
is the smallest integer
N
such that every graph
G
of order
N
contains a cycle
C
m
on m vertices or has independent number
α
(
G
)
≥
n
. ...