Proposal Title: Preprocessing for Modulo Scheduling within Open-Source ARM Cortex-A8 Compiler Principal Investigator (PI): Gang-Ryung Uh, Associate Professor Co-Principal Investigator (Co-PI): David Whalley, Professor Mailing Address of PI: MEC 302-N, Computer Science Department, Boise State University 1910 University Drive, Boise, ID 83725, USA Emails of PI and Co-PI: [email protected] and ...

The edge versions of reverse Wiener indices were introduced by Mahmiani et al. very recently. In this paper, we find their relation with ordinary (vertex) Wiener index in some graphs. Also, we compute them for trees and TUC4C8(s) naotubes.

The Hosoya index of a graph is defined as the total number of the matchings, including the empty edge set, of the graph. The Merrifield-Simmons index of a graph is defined as the total number of the independent vertex sets, including the empty vertex set, of the graph. Let U(n,∆) be the set of connected unicyclic graphs of order n with maximum degree ∆. We consider the Hosoya indices and the Me...

background: doppler indices of umbilical artery are used as indicator of fetal well being. objective: to compare doppler parameters of umbilical artery including pulsatility index (pi) and resistance index (ri) in patients with preeclampsia with those of normal pregnancies and to evaluate the diagnostic characteristics of these parameters in preeclampsia. materials and methods: in a case contro...

The Padmakar–Ivan (PI) index of a graph G is defined as the sum of terms [mu(e) + mv(e)] over all edges of G, where e is an edge, connecting the vertices u and v, wheremu(e) is the number of edges of G lying closer to the vertex u than to the vertex v, and where mv(e) is defined analogously. The extremal values of the PI index are determined in the class of connected bipartite graphs with a giv...

This paper studies co-k-plex vertex partitions and more specifically co-2-plex vertex partitions. Co-k-plexes and k-plexes were first introduced in 1978 in the context of social network analysis. However, the study of co-k-plex vertex partitions, or the decomposition of graphs into degree bounded subgraphs, dates back at least to the work of Lovasz in 1966. In this paper, we derive analogues fo...

Let G V, E be a simple graph. A set S ⊆ V is a dominating set of G, if every vertex in V \S is adjacent to at least one vertex in S. Let Pi n be the family of all dominating sets of a path Pn with cardinality i, and let d Pn, j |P n|. In this paper, we construct Pi n, and obtain a recursive formula for d Pn, i . Using this recursive formula, we consider the polynomialD Pn, x ∑n i n/3 d Pn, i x ...