The spectral closeness of a graph G is defined as the radius matrix , whose ( u v )-entry for vertex and 2 − d u,v ) if ≠ 0 otherwise, where distance between in . residual nontrivial minimum subgraphs with one deleted. We propose local grafting operations that decrease or increase determine those graphs uniquely minimize and/or maximize some families graphs. also discuss extremal properties clo...

Internet becomes a large & rich repository of information about us as individually. Any thing form user profile information to friends links the user subscribes to are reflection of social interactions as user has in real worlds. Social networking has created new ways to communicate and share information. Social networking websites are being used regularly by millions of people, and it now seem...

Many real and artificial entities in geographic space, such as transportation networks and trajectories of movement, are typically modeled as lines in geographic information systems. In a similar fashion, people also perceive such objects as lines and communicate about them accordingly as evidence from research on sketching habits suggests. To facilitate new modalities like sketching that rely ...

Three studies were conducted to examine the correlates of adult attachment. In Study 1, an 18-item scale to measure adult attachment style dimensions was developed based on Kazan and Shaver's (1987) categorical measure. Factor analyses revealed three dimensions underlying this measure: the extent to which an individual is comfortable with closeness, feels he or she can depend on others, and is ...

Human–animal relationships have long been the subject of controversy because they are shaped by several cultural, inter-individual, and evolutionary factors. Understanding these relationships, however, is important to optimize conservation efforts. There agreement that perceived similarity between animals humans associated with more positive attitudes. The human–animal could be caused phylogene...

One of the most important research topics about complex networks
 is examination their vulnerability. Therefore, there are many studies
 in literature analyzing robustness and reliability using graph theoretical parameters. Among these parameters, centrality
 parameters play an role.The closeness its derivatives
 widely discussed. In this study, parameter more sensitive&#x0D...

Evaluation of the competitiveness of high-tech industry is a technical decision-making issue involving multiple criteria. It is also a practical path to promote a country’s competitiveness. However, the competitiveness indicators in high-tech industry often act and react upon one another. Moreover, different dimensions and indicator weights also affect the evaluation results. In this paper, the...

In this paper, we present and compare various centrality measures for graphbased keyphrase extraction. Through experiments carried out on three standard datasets of different languages and domains, we show that simple degree centrality achieve results comparable to the widely used TextRank algorithm, and that closeness centrality obtains the best results on short documents.