Results 1 to 10 of about 1,300,845 (243)

The n-Hosoya Polynomials of the Square of a Path and of a Cycle [PDF]

open access: yesAl-Rafidain Journal of Computer Sciences and Mathematics, 2021
The n-Hosoya polynomial of a connected graph G of order t is defined by: Hn (G;x) = ∑ Cn (G;x) xk, where, Cn(G,k) is the number of pairs (v,S), in which |S| = n -1, 3 ≤ n ≤ t, v ∈ V(G) ,  S ⊆ V (G) , such that
Ahmed Ali
doaj   +1 more source

The n-Wiener Polynomials of the Cartesian Product of a Complete Graph with some Special Graphs [PDF]

open access: yesAl-Rafidain Journal of Computer Sciences and Mathematics, 2009
The n-Wiener polynomials of the Cartesian products of a complete graph Kt with another complete graph Kr, a star graph Sr, a complete bipartite graph Kr,s, a wheel Wr, and a path graph Pr are obtained in this paper.
Ali Ali, Haveen Ahmed
doaj   +1 more source

The n-Wiener Polynomials of Straight Hexagonal Chains and Kt×Cr [PDF]

open access: yesAl-Rafidain Journal of Computer Sciences and Mathematics, 2009
The n-Wiener polynomials of straight hexagonal chains and the Cartesian product of a complete graph Kr and a cycle Cr are obtained in this paper. The n-diameter and the n-Wiener index of each such graphs are also determined.
Ali Ali, Haveen Ahmed
doaj   +1 more source

Then-diameter of planar sets of constant width [PDF]

open access: yesInvolve, a Journal of Mathematics, 2012
We study the notion of [math] -diameter for sets of constant width. A convex set in the plane is said to be of constant width if the distance between two parallel support lines is constant, independent of the direction. The Reuleaux triangles are the well-known examples of sets of constant width that are not disks. The [math] -diameter of a compact set
Ibragimov, Zair, Le, Tuan
openaire   +2 more sources

Experimental study on the evaporating progress of hexane lens on immiscible liquid:Spreading and receding [PDF]

open access: yesE3S Web of Conferences, 2021
The change of evaporation liquid on another immiscible liquid has important guiding significance for many applications. In this experiment, the geometric temperature distribution and evaporation rate of n-hexane droplets were observed and recorded by ...
Chen Aiqiang   +4 more
doaj   +1 more source

Hosoya Polynomials of Steiner Distance of Complete m-partite Graphs and Straight Hexagonal Chains(*) [PDF]

open access: yesAl-Rafidain Journal of Computer Sciences and Mathematics, 2008
The Hosoya polynomials of Steiner distance of complete m-partite graphs  and Straight hexagonal chains  are obtained in this paper. The Steiner n-diameter and Wiener index of Steiner n-distance of   and   are also obtained.
Ali Ali, Herish Abdullah
doaj   +1 more source

Left atrial appendage morphology with the progression of atrial fibrillation

open access: yesPLoS ONE, 2022
Left atrial appendage (LAA) size is crucial for determining the indication of transcatheter LAA closure. The aim of this study was to evaluate the differences in LAA morphology according to the types of atrial fibrillation (AF).
Yoichi Takaya   +6 more
doaj   +2 more sources

S-nuclearity and n-diameters of infinite Cartesian products of bounded subsets in Banach spaces

open access: yesActa et Commentationes Universitatis Tartuensis de Mathematica, 2003
In this paper we classify compact subsets of a normed space according to the rate of convergence to zero of its sequence {δn(B)} of Kolmogorov diameters. We introduce σ-compact sets to satisfy that {δn(B)}∈σ where σ is an ideal of convergent to zero sequences.
Faried, Nashat, Fathey, Mona
openaire   +2 more sources

The Conditional Fault-Diameter of the K-ary n-Cube

open access: yesSultan Qaboos University Journal for Science, 2005
We obtain the conditional fault diameter of the k-ary n-cube interconnection network. It has been previously shown that under the condition of forbidden faulty sets (i.e.
Khaled Day, Abderezak Touzene
doaj   +1 more source

Brief Announcement: Faster Asynchronous MST and Low Diameter Tree Construction with Sublinear Communication [PDF]

open access: yes, 2019
Building a spanning tree, minimum spanning tree (MST), and BFS tree in a distributed network are fundamental problems which are still not fully understood in terms of time and communication cost.
King, Valerie, Mashreghi, Ali
core   +1 more source

Home - About - Disclaimer - Privacy