نتایج جستجو برای: edge hyper wiener index

تعداد نتایج: 533390  

2009
Kyle Xiang Zhang Yuk-Hee Chan Wan-Chi Siu

This paper presents an improved adaptive Wiener filtering algorithm for super-resolution reconstruction. When interpolating the high resolution pixels, the proposed algorithm locally adjusts the correlation model of the pixels by taking edge information into account. Simulation results show that the proposed algorithm produces SR outputs of better quality, both subjectively and objectively, as ...

2015
M. AZARI A. IRANMANESH

In this paper we study the behavior of the second edge-Wiener index under the join and corona product of graphs. Results are applied for some classes of graphs such as suspensions, bottlenecks, and thorny graphs. 2010 Mathematics Subject Classification: 05C12; 05C62; 92E10

Journal: :Eur. J. Comb. 2014
Sandi Klavzar Mohammad J. Nadjafi-Arani

It is proved that the Wiener index of a weighted graph (G, w) can be expressed as the sum of the Wiener indices of weighted quotient graphs with respect to an arbitrary combination of Θ∗-classes. Here Θ∗ denotes the transitive closure of the Djoković-Winkler’s relation Θ. A related result for edge-weighted graphs is also given and a class of graphs studied in [19] is characterized as partial cu...

Journal: :Journal of chemical information and computer sciences 2000
Ovidiu Ivanciuc Teodora Ivanciuc Daniel Cabrol-Bass Alexandru T. Balaban

Organic compounds containing heteroatoms or multiple bonds can be conveniently represented as vertex- and edge-weighted molecular graphs. These atom and bond parameters can be computed for any organic compound with two parameter sets that we have recently defined, namely, the relative electronegativity X and the relative covalent radius Y weighting schemes. Structural descriptors computed with ...

2013
Emeric Deutsch Sandi Klavžar

The Hosoya polynomial of a graph encompasses many of its metric properties, for instance the Wiener index (alias average distance) and the hyper-Wiener index. An expression is obtained that reduces the computation of the Hosoya polynomial of a graph with cut vertices to the Hosoya polynomial of the so-called primary subgraphs. The main theorem is applied to specific constructions including bouq...

M. GHORBANI, M. JALALI,

Dendritic macromolecules’ have attracted much attention as organic examples of well-defined nanostructures. These molecules are ideal model systems for studying how physical properties depend on molecular size and architecture. In this paper using a simple result, some GAP programs are prepared to compute Wiener and hyper Wiener indices of dendrimers.

Journal: :iranian journal of mathematical chemistry 2012
a. yoosofan m. namazi−fard

the mathematical properties of nano molecules are an interesting branch of nanoscience forresearches nowadays. the periodic open single wall tubulene is one of the nano moleculeswhich is built up from two caps and a distancing nanotube/neck. we discuss how toautomatically construct the graph of this molecule and plot the graph by spring layoutalgorithm in graphviz and netwrokx packages. the sim...

2012
Hongbo Hua

The second geometric-arithmetic index GA2(G) of a graph G was introduced recently by Fath-Tabar et al. [2] and is defined to be ∑ uv∈E(G) √ nu(e,G)nv(e,G) 1 2 [nu(e,G)+nv(e,G)] , where e = uv is one edge in G, and nu(e,G) denotes the number of vertices in G lying closer to u than to v. In this paper, we characterize the tree with the minimum GA2 index among the set of trees with given order and...

A.R. Ashrafi, G.H. Fath-Tabar,

The distance $d(u,v)$ between two vertices $u$ and $v$ of a graph $G$ is equal to the length of a shortest path that connects $u$ and $v$. Define $WW(G,x) = 1/2sum_{{ a,b } subseteq V(G)}x^{d(a,b) + d^2(a,b)}$, where $d(G)$ is the greatest distance between any two vertices. In this paper the hyper-Wiener polynomials of the Cartesian product, composition, join and disjunction of graphs are compu...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید