Results 81 to 90 of about 59,758 (255)
The linear and nonlinear (chir)optical properties of four oligoamide foldamers with different donor groups are studied by means of time‐dependent density functional theory calculations. It is shown that stronger donors yield larger hyperpolarizabilities due to low‐lying charge–transfer states. The agreement with the experiments concerning the key bands
Komlanvi Sèvi Kaka +5 more
wiley +1 more source
Weighted Szeged indices of some graph operations [PDF]
In this paper, the weighted Szeged indices of Cartesian product and Corona product of twoconnected graphs are obtained. Using the results obtained here, the weighted Szeged indices ofthe hypercube of dimension n, Hamming graph, C4 nanotubes, nanotorus ...
Kannan Pattabiraman, P. Kandan
doaj
Interval-Valued Fuzzy Soft Graphs
In this paper, we combine concepts of interval-valued fuzzy soft sets and graph theory. Then we introduce notations of interval-valued fuzzy soft graphs and complete interval-valued fuzzy soft graphs.
Zihni Onur +2 more
doaj +1 more source
A Multiplicative Version of Forgotten Topological Index [PDF]
In this paper, we present upper bounds for the multiplicative forgotten topological index of several graph operations such as sum, Cartesian product, corona product, composition, strong product, disjunction and symmetric difference in terms of the F ...
Asghar Yousefi +3 more
doaj +1 more source
Distinguishing Number for some Circulant Graphs [PDF]
Introduced by Albertson et al. \cite{albertson}, the distinguishing number $D(G)$ of a graph $G$ is the least integer $r$ such that there is a $r$-labeling of the vertices of $G$ that is not preserved by any nontrivial automorphism of $G$. Most of graphs
Gravier, Sylvain +2 more
core
Optimal model‐based design of experiments for parameter precision: Supercritical extraction case
Abstract This study investigates the process of chamomile oil extraction from flowers. A parameter‐distributed model consisting of a set of partial differential equations is used to describe the governing mass transfer phenomena in a cylindrical packed bed with solid chamomile particles under supercritical conditions using carbon dioxide as a solvent ...
Oliwer Sliczniuk, Pekka Oinas
wiley +1 more source
Complexity of Products of Some Complete and Complete Bipartite Graphs
The number of spanning trees in graphs (networks) is an important invariant; it is also an important measure of reliability of a network. In this paper, we derive simple formulas of the complexity, number of spanning trees, of products of some complete ...
S. N. Daoud
doaj +1 more source
Treewidth of Cartesian Products of Highly Connected Graphs [PDF]
AbstractThe following theorem is proved: for all k‐connected graphs G and H each with at least n vertices, the treewidth of the cartesian product of G and H is at least . For , this lower bound is asymptotically tight for particular graphs G and H. This theorem generalizes a well‐known result about the treewidth of planar grid graphs.
openaire +3 more sources
This paper aims to provide a robust design approach for HAWTs operating in shear flow. This study fills a critical research gap by integrating BEM and vortex theories for blade design in non‐homogeneous inflow conditions. The authors of the paper made an effort to develop and test an experimentally unsophisticated model of a turbine working in shear ...
Agnieszka Dorota Woźniak +2 more
wiley +1 more source
On the δ-chromatic numbers of the Cartesian products of graphs
In this work, we study the δ\delta -chromatic number of a graph, which is the chromatic number of the δ\delta -complement of a graph. We give a structure of the δ\delta -complements and sharp bounds on the δ\delta -chromatic numbers of the Cartesian ...
Tangjai Wipawee +2 more
doaj +1 more source

