Results 11 to 20 of about 3,375,631 (334)
Decomposing 10-Regular Graphs into Paths of Length 5
Let G be a 10-regular graph which does not contain any 4-cycles. In this paper, we prove that G can be decomposed into paths of length 5, such that every vertex is a terminal of exactly two paths.
Xie Mengmeng, Zhou Chuixiang
doaj +1 more source
Mathematical biology modules based on modern molecular biology and modern discrete mathematics. [PDF]
Robeva R, Davies R, Hodge T, Enyedi A.
europepmc +3 more sources
The purpose of this study is to determine whether the flipped learning method via MOODLE can improve learning outcomes and motivation to learn discrete mathematics during COVID-19 pandemic.
H. Mursyidah, R. P. Hermoyo, D. Suwaibah
semanticscholar +1 more source
In addition to wirelength and area, modern floorplans need to consider various constraints such as fixed-outline. To handle the fixed-outline floorplanning optimization problem efficiently, we propose an improved simulated annealing (SA) algorithm, which
Zhipeng Huang+3 more
doaj +1 more source
In this volume, the authors present a self-contained introduction to discrete mathematics – the science of finite and countably infinite structures. In addition to taking a theoretical approach, they also include many practical exercises. The text covers a broad range of topics such as propositional logic, set theory as well as detailed treatments of ...
Boschini, Cecilia+2 more
openaire +2 more sources
Generalized Hausdorff Operators on K̇α,qβ,pℝ and HK̇α,qβ,p,Nℝ in the Dunkl Settings
In the present paper, we obtain some new results, and we generalize some known results for the Hausdorff operators. We have studied the generalized Hausdorff operators Hα,φ on the Dunkl-type homogeneous weighted Herz spaces K̇α,qβ,pℝ and Dunkl Herz-type ...
Faouaz Saadi, Othman Tyr, Radouan Daher
doaj +1 more source
The extremal graphs with respect to their nullity
The nullity of a graph G, denoted by η ( G ) $\eta(G)$ , is the multiplicity of the eigenvalue zero of its adjacency matrix. In this paper, we determine all graphs with η ( G ) = n ( G ) − 2 m ( G ) − c ( G ) $\eta(G)=n(G) - 2m(G) -c(G)$ , where c ( G ) =
Sa Rula, An Chang, Yirong Zheng
doaj +1 more source
Independent resolving sets in graphs
Let be a connected graph. Let be a subset of V with an order imposed on W. The k-vector is called the resolving vector of v with respect to W. The set W is called a resolving set if for any two distinct vertices In this paper we investigate the existence
B. Suganya, S. Arumugam
doaj +1 more source
Bicyclic graphs with maximum sum of the two largest Laplacian eigenvalues
Let G be a simple connected graph and S 2 ( G ) $S_{2}(G)$ be the sum of the two largest Laplacian eigenvalues of G. In this paper, we determine the bicyclic graph with maximum S 2 ( G ) $S_{2}(G)$ among all bicyclic graphs of order n, which confirms the
Yirong Zheng+3 more
doaj +1 more source
A hierarchy of maximal intersecting triple systems [PDF]
We reach beyond the celebrated theorems of Erdȍs-Ko-Rado and Hilton-Milner, and a recent theorem of Han-Kohayakawa, and determine all maximal intersecting triples systems.
Joanna Polcyn, Andrzej Ruciński
doaj +1 more source