in future high-speed self-routing photonic networks based on all-optical time division multiplexing (otdm) it is highly desirable to carry out packet switching, clock recovery and demultplexing in the optical domain in order to avoid the bottleneck due to the optoelectronics conversion. in this paper we propose a self-routing otdm node structure composed of an all-optical router and demultiplex...

let $g=(v,e)$ be a connected graph. the eccentric connectivity index of $g$, $xi^{c}(g)$, is defined as $xi^{c}(g)=sum_{vin v(g)}deg(v)ec(v)$, where $deg(v)$ is the degree of a vertex $v$ and $ec(v)$ is its eccentricity. the eccentric distance sum of $g$ is defined as $xi^{d}(g)=sum_{vin v(g)}ec(v)d(v)$, where $d(v)=sum_{uin v(g)}d_{g}(u,v)$ and $d_{g}(u,v)$ is the distance between $u$ and $v$ ...

let g be a graph. the first zagreb m1(g) of graph g is defined as: m1(g) = uv(g) deg(u)2. in this paper, we prove that each even number except 4 and 8 is a first zagreb index of a caterpillar. also, we show that the fist zagreb index cannot be an odd number. moreover, we obtain the fist zagreb index of some graph operations.

The eccentricity connectivity index of a molecular graph G is defined as (G) = aV(G) deg(a)ε(a), where ε(a) is defined as the length of a maximal path connecting a to other vertices of G and deg(a) is degree of vertex a. Here, we compute this topological index for some infinite classes of dendrimer graphs.

As an inorganic chemical, magnesium iodide has a significant crystalline structure. It is complex and multi-functional substance that the potential to be used in wide range of medical advancements. Molecular graph theory, on other hand, provides sufficient cost-effective method investigating chemical structures networks. M-polynomial relatively new for studying networks molecular theory. displa...

In this paper we introduce a family of polynomials indexed by pairs of partitions and show that if these polynomials are self-orthogonal then the centre of the Iwahori-Hecke algebra of the symmetric group is precisely the set of symmetric polynomials in the Murphy operators.

In this paper we introduce a family of polynomials indexed by pairs of partitions and show that if these polynomials are self–orthogonal then the centre of the Iwahori–Hecke algebra of the symmetric group is precisely the set of symmetric polynomials in the Murphy operators.

Blood flow dynamics under physiologically realistic pulsatile conditions plays an important role in the growth, rupture, and surgical treatment of intracranial aneurysms. The temporal and spatial variations of wall pressure and wall shear stress in the aneurysm are hypothesized to be correlated with its continuous expansion and eventual rupture. In addition, the assessment of the velocity field...

If G is a connected graph with vertex set V (G), then the eccentric connectivity index of G, denoted by ξc(G), is defined as ∑ v∈V (G) deg(v)ec(v), where deg(v) is the degree of a vertex v and ec(v) is its eccentricity. Morgan et al. [5] investigated the eccentric connectivity index of trees. In this paper, we investigate the eccentric connectivity index of unicyclic graphs. Upper bound is obta...