We consider the behavior of distances between vertices and number of subtrees, as topological indices, in trees. The extremal ratios of the corresponding local functions of such indices at the middle part or leaves are given and the structures achieving such extremal ratios are characterized. This is joint work with Laszlo Szekely
Abstract. Introduced in 1947, theWiener indexW(T) = {u,v}⊆V(T) d(u, v) is one of themost thoroughly ...
Stablo je povezan aciklički graf, tj. povezan graf koji ne sadrži cikluse. Brojni autori posvetili s...
When considering the number of subtrees of trees, the extremal structures which maximize this number...
We discovered a dual behavior of two tree indices, the Wiener index and the number of subtrees, for ...
The authors discovered a dual behaviour of two tree indices, the Wiener index and the number of subt...
AbstractVarious topological indices have been put forward in different studies, from biochemistry to...
Various topological indices have been put forward in different studies from bio-chemistry to pure ma...
AbstractThe distance of a vertex u in a connected graph G is defined by σ(u) = ∑ v ϵ V(G)d(u, v) and...
The authors discovered a dual behaviour of two tree indices, the Wiener index and the number of subt...
In this talk we survey some work on the number of subtrees and total distances in trees, most of whi...
As one of the most important topological indices emerged from the study of quantitative structure-ac...
In this chapter we explore recent development on various problems related to graph indices in trees....
For trees, we present an interesting semi-regular property, which emerged from the study of the extr...
Graph invariants known as topological indices are frequently used in applied mathematics, biochemist...
The subtrees of a tree have been studied from various points of view. In particular, the extremal tr...
Abstract. Introduced in 1947, theWiener indexW(T) = {u,v}⊆V(T) d(u, v) is one of themost thoroughly ...
Stablo je povezan aciklički graf, tj. povezan graf koji ne sadrži cikluse. Brojni autori posvetili s...
When considering the number of subtrees of trees, the extremal structures which maximize this number...
We discovered a dual behavior of two tree indices, the Wiener index and the number of subtrees, for ...
The authors discovered a dual behaviour of two tree indices, the Wiener index and the number of subt...
AbstractVarious topological indices have been put forward in different studies, from biochemistry to...
Various topological indices have been put forward in different studies from bio-chemistry to pure ma...
AbstractThe distance of a vertex u in a connected graph G is defined by σ(u) = ∑ v ϵ V(G)d(u, v) and...
The authors discovered a dual behaviour of two tree indices, the Wiener index and the number of subt...
In this talk we survey some work on the number of subtrees and total distances in trees, most of whi...
As one of the most important topological indices emerged from the study of quantitative structure-ac...
In this chapter we explore recent development on various problems related to graph indices in trees....
For trees, we present an interesting semi-regular property, which emerged from the study of the extr...
Graph invariants known as topological indices are frequently used in applied mathematics, biochemist...
The subtrees of a tree have been studied from various points of view. In particular, the extremal tr...
Abstract. Introduced in 1947, theWiener indexW(T) = {u,v}⊆V(T) d(u, v) is one of themost thoroughly ...
Stablo je povezan aciklički graf, tj. povezan graf koji ne sadrži cikluse. Brojni autori posvetili s...
When considering the number of subtrees of trees, the extremal structures which maximize this number...