Skip to main content
×
Home

ON THE DEGREE DISTANCE OF SOME COMPOSITE GRAPHS

  • HONGBO HUA (a1) (a2)
Abstract
Abstract

Let G be a connected simple graph. The degree distance of G is defined as D′(G)=∑ uV (G)dG(u)DG(u), where DG(u) is the sum of distances between the vertex u and all other vertices in G and dG(u) denotes the degree of vertex u in G. In contrast to many established results on extremal properties of degree distance, few results in the literature deal with the degree distance of composite graphs. Towards closing this gap, we study the degree distance of some composite graphs here. We present explicit formulas for D′ (G) of three composite graphs, namely, double graphs, extended double covers and edge copied graphs.

    • 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.

      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.

      ON THE DEGREE DISTANCE OF SOME COMPOSITE GRAPHS
      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 Dropbox account. Find out more about sending content to Dropbox.

      ON THE DEGREE DISTANCE OF SOME COMPOSITE GRAPHS
      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 Google Drive account. Find out more about sending content to Google Drive.

      ON THE DEGREE DISTANCE OF SOME COMPOSITE GRAPHS
      Available formats
      ×
Copyright
References
Hide All
[1]Alon N., ‘Eigenvalues and expanders’, Combinatorica 6 (1986), 8396.
[2]Bondy J. A. and Murty U. S. R., Graph Theory with Applications (Macmillan, London, 1976).
[3]Bucicovschia O. and Cioabva S. M., ‘The minimum degree distance of graphs of given order and size’, Discrete Appl. Math. 156 (2008), 35183521.
[4]Chen S. and Liu W., ‘Extremal modified Schultz index of bicyclic graphs’, MATCH Commun. Math. Comput. Chem. 64 (2010), 767782.
[5]Dankelmann P., Gutman I., Mukwembi S. and Swart H. C., ‘On the degree distance of a graph’, Discrete Appl. Math. 157 (2009), 27732777.
[6]Dobrynin A., Entringer R. and Gutman I., ‘Wiener index of trees: theory and applications’, Acta Appl. Math. 66 (2001), 211249.
[7]Dobrynin A. A. and Kochetova A. A., ‘Degree distance of a graph: a degree analogue of the Wiener index’, J. Chem. Inf. Comput. Sci. 34 (1994), 10821086.
[8]Du Z. and Zhou B., ‘Degree distance of unicyclic graphs’, Filomat 24 (2010), 95120.
[9]Gutman I., ‘Selected properties of the Schultz molecular topogical index’, J. Chem. Inf. Comput. Sci. 34 (1994), 10871089.
[10]Horoldagva B. and Gutman I., ‘On some vertex-degree-based graph invariants’, MATCH Commun. Math. Comput. Chem. 65 (2011), 723730.
[11]Ilić A., Klavžar S. and Stevanović D., ‘Calculating the degree distance of partial Hamming graphs’, MATCH Commun. Math. Comput. Chem. 63 (2010), 411424.
[12]Ilić A., Stevanović D., Feng L., Yu G. and Dankelmann P., ‘Degree distance of unicyclic and bicyclic graphs’, Discrete Appl. Math. 159 (2011), 779788.
[13]Khormali O., Iranmanesh A., Gutman I. and Ahmadi A., ‘Generalized Schultz index and its edge versions’, MATCH Commun. Math. Comput. Chem. 64 (2010), 783798.
[14]Klavzǎr S. and Gutman I., ‘Wiener number of vertex-weighted graphs and a chemical application’, Discrete Appl. Math. 80 (1997), 7381.
[15]Tomescu I., ‘Some extremal properties of the degree distance of a graph’, Discrete Appl. Math. 98 (1999), 159163.
[16]Tomescu I., ‘Properties of connected graphs having minimum degree distance’, Discrete Math. 309 (2008), 27452748.
[17]Tomescu I., ‘Ordering connected graphs having small degree distances’, Discrete Appl. Math. 158 (2010), 17141717.
[18]Tomescu A. I., ‘Unicyclic and bicyclic graphs having minimum degree distance’, Discrete Appl. Math. 156 (2008), 125130.
[19]Tomescu A. I., ‘Minimal graphs with respect to the degree distance’, Technical Report, University of Bucharest, 2008, available online at: http://sole.dimi.uniud.it/∼alexandru.tomescu/files/dd-distance.pdf.
[20]Yan W. and Yeh Y.-N., ‘On the number of matchings of graphs formed by a graph operation’, Sci. China Ser. A 49 (2006), 13831391.
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? *
×
MathJax

Keywords:

Metrics

Full text views

Total number of HTML views: 2
Total number of PDF views: 51 *
Loading metrics...

Abstract views

Total abstract views: 45 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 24th November 2017. This data will be updated every 24 hours.