#### Filter Results:

- Full text PDF available (14)

#### Publication Year

1999

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

Three splice variants of the mouse metabotropic glutamate receptor 1, mGluR1E55, mGluR1a and mGluR1b, have been isolated from mouse brain cDNA libraries. The sequences of mGluR1a and mGluR1b are similar to those from rat and human. mGluR1E55 is a novel splice variant. mGluR1E55 has two additional exons. One is 80-bp long at the 5' untranslational region.… (More)

For a graph, the first Zagreb index M 1 is equal to the sum of the squares of the degrees of the vertices, and the second Zagreb index M 2 is equal to the sum of the products of the degrees of pairs of adjacent vertices. This paper investigates the Zagreb indices of unicyclic graphs by introducing some transformations, and characterize the unicyclic graphs… (More)

- Shubo Chen, Weijun Liu
- 2012

For a graph G = (V, E), the modified Schultz index of G is defined as S * (G) = {u,v}⊆V (G) where d G (u) (or d(u)) is the degree of the vertex u of G, and d G (u, v) is the distance between u and v. Let B(n) be the set of bicyclic graph with n vertices. In this paper, we study the modified Schultz index of B(n), graphs in B(n) with the smallest modified… (More)

If G is a (molecular) graph with n vertices, and d i is the degree of its i-th vertex, then the sum-connectivity index of G is the sum of the weights (d u + d v) − 1 2 of all edges uv of G. A polyomino system is a finite 2-connected plane graph such that each interior face (or say a cell) is surrounded by a regular square of length one. Formulas for… (More)

The Randi´c index R(G) of an organic molecule whose molecular graph is G is the sum of the weights (d u d v) − 1 2 of all edges uv of G, where d u (or d v) denote the degree of vertex u(or v). Efficient formulas for calculating the Randi´c index of polyomino chains are provided.

- Lixing Xu, Shubo Chen
- Appl. Math. Lett.
- 2008

- Shubo Chen
- J. Comb. Optim.
- 2016

- Shubo Chen, Kejing He
- SmartCity
- 2015

- Shubo Chen, Houqing Zhou
- Ars Comb.
- 2010

The resistance distance r(u, v) between two vertices u, v of a connected graph G is defined as the effective resistance between them in the corresponding electrical network constructed from G by replacing each edge of G with a unit resistor. Let G be a connected graph, the degree resistance distance of G is defined as D R (G) = {u,v}⊆V (G) [d(u) + d(v)]r(u,… (More)