A set of vertices $S$ a graph $G$ is $monophonically \ convex$ if every induced path joining two contained in $S$. The $monophonic convex hull$ $S$, $\langle S \rangle$, the smallest monophonically containing convexly independent$ $v \not\in \langle - \{v\} \rangle$ for \in S$. rank$ size largest monophonic independent $G$. We present characterization sets. Using this result, we show how to det...

A b s t r a c t. A tree is said to be starlike if exactly one of its vertices has degree greater than two. We show that almost all starlike trees are hyperbolic, and determine all exceptions. If k is the maximal vertex degree of a starlike tree and λ 1 is its largest eigenvalue, then √ k ≤ λ 1 < k/ √ k − 1. A new way to characterize integral starlike trees is put forward.

We extend the “Extension after Restriction Principle” for symplectic embeddings of bounded starlike domains to a large class of symplectic embeddings of unbounded starlike domains.

AbstractIn this paper we introduce the subclass K(μ, γ, η, α, β) of β-uniformly convex and β-uniformly starlike functions which are analytic and multivalent with negative coefficients defined by using fractional calculus operators. Characterization property exhibited by the functions in the class and the results of modified Hadamard product are discussed. Connections with the popular subclasses...

Here, we find the characteristics polynomial of normalized Laplacian of a tree. The coefficients of this polynomial are expressed by the higher order general Randić indices for matching, whose values depend on the structure of the tree. We also find the expression of these indices for starlike tree and a double-starlike tree, Hm(p, q). Moreover, we show that two cospectral Hm(p, q) of the same ...

The Hadwiger number H(S) of a topological disk S in R 2 is the maximal number of pairwise nonoverlapping translates of S that touch S. A conjecture of A. Bezdek., K. and W. Kuperberg [2] states that this number is at most eight for any starlike disk. A. Bezdek [1] proved that the Hadwiger number of a starlike disk is at most seventy five. In this note, we prove that the Hadwiger number of any c...

Here we study the normalized Laplacian characteristics polynomial (L-polynomial) for trees and specifically for starlike trees. We describe how the L-polynomial of a tree depends on some topological indices. For which, we also define the higher order general Randić indices for matching and which are different from higher order connectivity indices. Finally we provide the multiplicity of the eig...

*Correspondence: [email protected] 1School of Mathematical Sciences, Universiti Sains Malaysia, 11800 USM, Penang, Malaysia Full list of author information is available at the end of the article Abstract The estimates for the second Hankel determinant a2a4 – a3 of the analytic function f (z) = z + a2z + a3z + · · · , for which either zf ′(z)/f (z) or 1 + zf ′′(z)/f ′(z) is subordinate to a certai...

A tree which has exactly one vertex of degree greater than two is said to be starlike. In spite of seemingly simple structure of these trees, not much is known about their spectral properties. In this paper, we introduce a generalization of the notion of cospectrality called m-cospectrality which turns out to be useful in constructing cospectral graphs. Based on this, we construct cospectral ma...