the topological index of a graph g is a numeric quantity related to g which is invariant underautomorphisms of g. the vertex pi polynomial is defined as piv (g)  euv nu (e)  nv (e).then omega polynomial (g,x) for counting qoc strips in g is defined as (g,x) =cm(g,c)xc with m(g,c) being the number of strips of length c. in this paper, a new infiniteclass of fullerenes is constructed. the ...

Much effort in scientific visualization is put towards the representation and communication of three-dimensional objects. Typically, an investigator labors in front of a graphics workstation, twiddling knobs and flipping switches until meaningful views of the object are created. Once the investigator has found the correct representation of the data, the problem arises of how to communicate this...

Weighted Hosoya polynomials have been developed by Diudea, in ref. Studia Univ. "Babes-Bolyai", 2002, 47, 131-139. Among various weighting schemes, those polynomials obtained by using Diudea's Shell matrix operator are far more interesting. We present here the Shell-Distance and Shell-Degree-Distance polynomials and close formulas to calculate them and derived Cluj-Tehran CT index in the family...

Yoshiaki NAKAZAWA*, Kenji TAMURA *, Michitaka YOSHIDA* Katsutoshi TAKAGI† and Mitsutoshi KANO† * Sumitomo Metal Industries, Ltd. Corporate Research and Development Laboratories 1-8 Fuso-cho, Amagasaki, Hypgo, 660-0891, Japan e-mail: [email protected], web page: http://www. sumitomometals.co.jp †Toyoda Iron Works CO., LTD. Product Research and Development DIV.NO.2 4-50 Hosoya-cho...

Regular Expressions (REs) form the basis of most XML type languages, such as DTDs, XML Schema types, and XDuce types (Thompson et al. 2004; Hosoya and Pierce 2003). In this context, the interleaving operator would be a natural addition to the language of REs, as witnessed by the presence of limited forms of interleaving in XSD (the all group), Relax-NG, and SGML. Unfortunately, membership check...

let $g$ be a simple graph of order $n$‎. ‎we consider the‎ ‎independence polynomial and the domination polynomial of a graph‎ ‎$g$‎. ‎the value of a graph polynomial at a specific point can give‎ ‎sometimes a very surprising information about the structure of the‎ ‎graph‎. ‎in this paper we investigate independence and domination‎ ‎polynomial at $-1$ and $1$‎.