Results 1 to 10 of about 668,914 (263)
On minimum intersections of certain secondary dominating sets in graphs [PDF]
Opuscula Mathematica, 2023 In this paper we consider secondary dominating sets, also named as \((1,k)\)-dominating sets, introduced by Hedetniemi et al. in 2008. In particular, we study intersections of the \((1,1)\)-dominating sets and proper \((1,2)\)-dominating sets.
Anna Kosiorowska +2 more
doaj +1 more source
$L^p$-$L^q$ Boundedness of Spectral Multipliers of the Anharmonic Oscillator
Comptes Rendus. Mathématique, 2022 In this note we study the $L^p-L^q$ boundedness of Fourier multipliers of anharmonic oscillators, and as a consequence also of spectral multipliers, for the range ...
Chatzakou, Marianna, Kumar, Vishvesh
doaj +1 more source
Local irregularity conjecture for 2-multigraphs versus cacti [PDF]
Opuscula Mathematica, 2023 A multigraph is locally irregular if the degrees of the end-vertices of every multiedge are distinct. The locally irregular coloring is an edge coloring of a multigraph \(G\) such that every color induces a locally irregular submultigraph of \(G\).
Igor Grzelec, Mariusz Woźniak
doaj +1 more source
Time-stage driven pathfinding framework for optimized medical treatments
Cogent Engineering, 2023 Coming up with the correct patient-specific treatment procedure is a non-trivial task. One of the main challenges is that the problem is combinatorial, and each treatment can be followed by numerous treatments.
Karen Gishyan +2 more
doaj +1 more source
Decomposing 10-Regular Graphs into Paths of Length 5
Discussiones Mathematicae Graph Theory, 2022 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
IEEE Access, 2020 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
Generalized Hausdorff Operators on K̇α,qβ,pℝ and HK̇α,qβ,p,Nℝ in the Dunkl Settings
Journal of Function Spaces, 2021 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
Journal of Inequalities and Applications, 2016 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
Bicyclic graphs with maximum sum of the two largest Laplacian eigenvalues
Journal of Inequalities and Applications, 2016 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
Independent resolving sets in graphs
AKCE International Journal of Graphs and Combinatorics, 2021 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