On the spectral radius of unicyclic graphs with fixed diameter

In the paper, we will determine graphs with the maximal spectral radius among all the unicyclic graphs with n vertices and diameter d.

[1]  Tomasz Imielinski,et al.  Data on Air: Organization and Access , 1997, IEEE Trans. Knowl. Data Eng..

[2]  Arbee L. P. Chen,et al.  An Adaptive Access Method for Broadcast Data under an Error-Prone Mobile Environment , 2000, IEEE Trans. Knowl. Data Eng..

[3]  Tomasz Imielinski,et al.  Energy efficient indexing on air , 1994, SIGMOD '94.

[4]  Le Gruenwald,et al.  An Access Time Cost Model for Spatial Range Queries on Broadcast Geographical Data over Air , 2003, DEXA.

[5]  Yaoping Hou,et al.  Bounds on the largest eigenvalues of trees with a given size of matching , 2002 .

[6]  Jeffrey Xu Yu,et al.  Supporting Range Queries in a Wireless Environment with Nonuniform Broadcast , 1999, Data Knowl. Eng..

[7]  Dragos Cvetkovic,et al.  Spectra of unicyclic graphs , 1987, Graphs Comb..

[8]  Ye-In Chang,et al.  A complementary approach to data broadcasting in mobile information systems , 2002, Data Knowl. Eng..

[9]  Philip S. Yu,et al.  Optimizing Index Allocation for Sequential Data Broadcasting in Wireless Mobile Computing , 2003, IEEE Trans. Knowl. Data Eng..

[10]  Walid G. Aref,et al.  Query Processing in Broadcasted Spatial Index Trees , 2001, SSTD.

[11]  Huiqing Liu,et al.  On the spectral radius of graphs with cut edges , 2004 .

[12]  Béla Bollobás,et al.  Modern Graph Theory , 2002, Graduate Texts in Mathematics.

[13]  L. Beineke,et al.  Selected Topics in Graph Theory 2 , 1985 .

[14]  Jeffrey Xu Yu,et al.  An Analysis of Selective Tuning Schemes for Nonuniform Broadcast , 1997, Data Knowl. Eng..

[15]  Philip S. Yu,et al.  Indexed sequential data broadcasting in wireless mobile computing , 1997, Proceedings of 17th International Conference on Distributed Computing Systems.

[16]  H.B. Walikar,et al.  On the Eigenvalues of a Graph , 2003, Electron. Notes Discret. Math..

[17]  Baofeng Wu,et al.  The spectral radius of trees on k pendant vertices , 2005 .

[18]  Stanley B. Zdonik,et al.  A framework for scalable dissemination-based systems , 1997, OOPSLA '97.

[19]  Jia-Yu Shao,et al.  On the spectral radius of trees with fixed diameter , 2006 .

[20]  Slobodan K. Simić,et al.  On the Largest Eigenvalue of Unicyclic Graphs , 1987 .

[21]  L. Tassiulas,et al.  Broadcast scheduling for information distribution , 1997, Proceedings of INFOCOM '97.

[22]  D. Cvetkovic,et al.  The largest eigenvalue of a graph: A survey , 1990 .

[23]  Hans-Peter Kriegel,et al.  The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.

[24]  Michael Doob,et al.  Spectra of graphs , 1980 .

[25]  Le Gruenwald,et al.  Optimizing data placement over wireless broadcast channel for multi-dimensional range query processing , 2004, IEEE International Conference on Mobile Data Management, 2004. Proceedings. 2004.

[26]  Beng Chin Ooi,et al.  On Selective Tuning in Unreliable Wireless Channels , 1998, Data Knowl. Eng..

[27]  Nick Roussopoulos,et al.  Nearest neighbor queries , 1995, SIGMOD '95.

[28]  Xiao-Dong Zhang,et al.  On the Spectral Radius of Graphs with Cut Vertices , 2001, J. Comb. Theory, Ser. B.

[29]  Christos Faloutsos,et al.  On packing R-trees , 1993, CIKM '93.

[30]  Wang-Chien Lee,et al.  Spatial Queries in Wireless Broadcast Systems , 2004, Wirel. Networks.

[31]  Hanan Samet,et al.  The Design and Analysis of Spatial Data Structures , 1989 .

[32]  Rafael Alonso,et al.  Broadcast disks: data management for asymmetric communication environments , 1995, SIGMOD '95.

[33]  Shu-Guang Guo,et al.  The spectral radius of unicyclic and bicyclic graphs with n vertices and k pendant vertices , 2005 .

[34]  Sanjeev Khanna,et al.  On indexed data broadcast , 1998, STOC '98.

[35]  Shengbiao Hu.  The largest eigenvalue of unicyclic graphs , 2007, Discret. Math..

[36]  Feng Tian,et al.  On the spectral radius of unicyclic graphs with perfect matchings , 2003 .