Skip to main content Accesibility Help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
Cancel
×
×
Home
  • Home
Article
  • Cited by 55
  • Cited by
    Crossref Citations
    Crossref logo
    This article has been cited by the following publications. This list is generated based on data provided by CrossRef.
    Anđelić, M. Simić, S.K. Živković, D. and Dolićanin, E.Ć. 2018. Fast algorithms for computing the characteristic polynomial of threshold and chain graphs. Applied Mathematics and Computation, Vol. 332, Issue. , p. 329.
    Imran, Shahid Siddiqui, Muhammad Imran, Muhammad and Hussain, Muhammad 2018. On Metric Dimensions of Symmetric Graphs Obtained by Rooted Product. Mathematics, Vol. 6, Issue. 10, p. 191.
    Zhu, Bao-Xuan 2018. Unimodality of independence polynomials of the incidence product of graphs. Discrete Mathematics, Vol. 341, Issue. 8, p. 2359.
    Levit, Vadim E. and Mandrescu, Eugen 2018. Graph Operations Preserving W 2 -Property. Electronic Notes in Discrete Mathematics, Vol. 68, Issue. , p. 35.
    Maghsoudi, Maryam and Heydari, Abbas 2018. The signless Laplacian spectrum of rooted product of graphs. Discrete Mathematics, Algorithms and Applications, Vol. 10, Issue. 06, p. 1850076.
    Ahmad, Uzma Hameed, Saira and Jabeen, Shaista 2018. Class of weighted graphs with strong anti-reciprocal eigenvalue property. Linear and Multilinear Algebra, p. 1.
    Qi, Yi Yi, Yuhao and Zhang, Zhongzhi 2018. Topological and Spectral Properties of Small-World Hierarchical Graphs. The Computer Journal,
    Andelić, Milica Ashraf, Firouzeh da Fonseca, Carlos M. and Simić, Slobodan K. 2018. Vertex types in some lexicographic products of graphs. Linear and Multilinear Algebra, p. 1.
    Bapat, Aniruddha Eldredge, Zachary Garrison, James R. Deshpande, Abhinav Chong, Frederic T. and Gorshkov, Alexey V. 2018. Unitary entanglement construction in hierarchical networks. Physical Review A, Vol. 98, Issue. 6,
    Álvarez-Ruiz, M.P. Mediavilla-Gradolph, T. Sheikholeslami, S.M. Valenzuela-Tripodoro, J.C. and Yero, I.G. 2017. On the strong Roman domination number of graphs. Discrete Applied Mathematics, Vol. 231, Issue. , p. 44.
    Akhter, Shehnaz Imran, Muhammad and Raza, Zahid 2017. Bounds for the general sum-connectivity index of composite graphs. Journal of Inequalities and Applications, Vol. 2017, Issue. 1,
    Cabrera Martínez, Abel Sigarreta Almira, José M. and Yero, Ismael G. 2017. On the independence transversal total domination number of graphs. Discrete Applied Mathematics, Vol. 219, Issue. , p. 65.
    Lee, Hojin Nguyen, Linh Thi Hoai and Fujisaki, Yasumasa 2017. Algebraic connectivity of network-of-networks having a graph product structure. Systems & Control Letters, Vol. 104, Issue. , p. 15.
    Lou, Zhenzhen Huang, Qiongxiang and Huang, Xueyi 2017. Construction of graphs with distinct eigenvalues. Discrete Mathematics, Vol. 340, Issue. 4, p. 607.
    Panda, S.K. and Pati, S. 2017. On some graphs which satisfy reciprocal eigenvalue properties. Linear Algebra and its Applications, Vol. 530, Issue. , p. 445.
    Kuziak, Dorota Yero, Ismael G. and Rodríguez-Velázquez, Juan A. 2016. Strong metric dimension of rooted product graphs. International Journal of Computer Mathematics, Vol. 93, Issue. 8, p. 1265.
    Ghorbani, Modjtaba and Songhori, Mahin 2016. Distance, Symmetry, and Topology in Carbon Nanomaterials. Vol. 9, Issue. , p. 317.
    Oooka, Kanaru and Oguchi, Toshiki 2016. Estimation of Synchronization Patterns of Chaotic Systems in Cartesian Product Networks with Delay Couplings. International Journal of Bifurcation and Chaos, Vol. 26, Issue. 10, p. 1630028.
    Ghosh, Tapanendu Mondal, Sukanya Karmakar, Somnath and Mandal, Bholanath 2016. Symmetry-adapted linear combinations for the eigenvalues and eigenvectors of reciprocal graphs. Molecular Physics, Vol. 114, Issue. 22, p. 3307.
    Zhu, Bao-Xuan 2016. Clique cover products and unimodality of independence polynomials. Discrete Applied Mathematics, Vol. 206, Issue. , p. 172.
    Download full list
    ×
  • Access

A new graph product and its spectrum

  • C.D. Godsil (a1) and B.D. McKay (a2)
Abstract

A new graph product is introduced, and the characteristic polynomial of a graph so–formed is given as a function of the characteristic polynomials of the factor graphs. A class of trees produced using this product is shown to be characterized by spectral properties.

    •
      • Send article to Kindle

      To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

      Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

      Find out more about the Kindle Personal Document Service.

      A new graph product and its spectrum
      Available formats
      ×
      Send article to Dropbox

      To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

      A new graph product and its spectrum
      Available formats
      ×
      Send article to Google Drive

      To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

      A new graph product and its spectrum
      Available formats
      ×
Copyright
COPYRIGHT: © Australian Mathematical Society 1978
References
Hide All
[1]Behzad, Mehdi, Chartrand, Gary, Introduction to the theory of graphs (Allyn and Bacon, Boston, 1971).
[2]Godsil, C. and McKay, B., “Some computational results on the spectra of graphs”, Combinatorial Mathematics IV, 73–92 (Proc. Fourth Austral. Conf., University of Adelaide, 1975 Lecture Notes in Mathematics, 560. Springer-Verlag, Berlin, Heidelberg, New York, 1976).
[3]Sachs, Horst, “Beziehungen zwischen den in einem Graphen enthaltenen Kreisen und seinem charakteristischen Polynom”, Publ. Math. Debrecen 11 (1964), 119–134.
[4]Schwenk, Allen J., “Computing the characteristic polynomial of a graph”, Graphs and combinatorics, 153–172 (Proc. Capital Conf. Graph Theory and Combinatorics, George Washington University, 1973. Lecture Notes in Mathematics, 406. Springer-Verlag, Berlin, Heidelberg, New York, 1974).
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Bulletin of the Australian Mathematical Society
  • ISSN: 0004-9727
  • EISSN: 1755-1633
  • URL: /core/journals/bulletin-of-the-australian-mathematical-society
Please enter your name
Please enter a valid email address
Who would you like to send this to? *

CAPTCHA *

Skip to the audio challenge
×
MathJax

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed

Cancel
Confirm
×