Results 11 to 20 of about 24,777 (243)
Design‐Assisted Chemometric UV Spectrophotometric Determination of Candesartan Cilexetil, Chlorthalidone and Amlodipine Using Principal Component Regression, Partial Least Squares and Genetic Algorithm‐Partial Least Squares Models [PDF]
ABSTRACT This study presents a sustainable chemometric‐assisted UV spectrophotometric strategy for the simultaneous determination of candesartan cilexetil (CAN), chlorthalidone (CTL) and amlodipine (AML) in laboratory‐prepared mixtures and commercial pharmaceutical formulations.
Khanda F. M. Amin +3 more
wiley +2 more sources
Spanning paths in hypercubes [PDF]
Given a family $\{u_i,v_i\}_{i=1}^k$ of pairwise distinct vertices of the $n$-dimensional hypercube $Q_n$ such that the distance of $u_i$ and $v_i$ is odd and $k \leq n-1$, there exists a family $\{P_i\}_{i=1}^k$ of paths such that $u_i$ and $v_i$ are ...
Tomáš Dvořák +2 more
doaj +1 more source
A general analytical model of adaptive wormhole routing in k-ary n-cubes [PDF]
Several analytical models of fully adaptive routing have recently been proposed for k-ary n-cubes and hypercube networks under the uniform traffic pattern.
Ould-Khaoua, M. +2 more
core +3 more sources
Set-to-Set Disjoint Path Routing in Bijective Connection Graphs
The bijective connection graph encompasses a family of cube-based topologies, and $n$ -dimensional bijective connection graphs include the hypercube and almost all of its variants with the order $2^{n}$ and the degree $n$ .
Keiichi Kaneko +2 more
doaj +1 more source
On regular subgraphs of augmented cubes
The n-dimensional augmented cube AQn is a variation of the hypercube It is a -regular and -connected graph on vertices. One of the fundamental properties of AQn is that it is pancyclic, that is, it contains a cycle of every length from 3 to In this paper,
Amruta Shinde, Y. M. Borse
doaj +1 more source
Two kinds of conditional connectivity of hypercubes
A subset [Formula: see text] is called an h-extra r-component cut of G if G – F is disconnected and there are at least r components, each component has at least h + 1 vertices.
Bo Zhu +3 more
doaj +1 more source
The line completion number of hypercubes
In 1992, Bagga, Beineke, and Varma introduced the concept of the super line graph of index of a graph denoted by The vertices of are the -subsets of and two vertices and are adjacent if there exist and such that and are adjacent edges in They also ...
S.A. Tapadia, B.N. Waphare
doaj +1 more source
Embedding Spanning Disjoint Cycles in Hypercube Networks with Prescribed Edges in Each Cycle
One of the important issues in evaluating an interconnection network is to study the hamiltonian cycle embedding problems. A graph G is spanning k-edge-cyclable if for any k independent edges e1,e2,…,ek of G, there exist k vertex-disjoint cycles C1,C2 ...
Weiyan Wu, Eminjan Sabir
doaj +1 more source
Hyperspectral imaging is currently a very well-known and much used technology for measuring features in different fields, such as chemistry, geology, medicine, food and agriculture, either spaceborne (satellites), airborne (drones) or at close proximity (
Gerrit Polder, Aoife Gowen
doaj +1 more source

