Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Sum-connectivity index of a graph

From MaRDI portal
Publication:256504
Jump to:navigation, search

DOI10.1007/s11464-015-0470-2zbMath1331.05120OpenAlexW822886830MaRDI QIDQ256504

Bo Zhou, Sumana Das, Kinkar Chandra Das

Publication date: 9 March 2016

Published in: Frontiers of Mathematics in China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11464-015-0470-2


zbMATH Keywords

minimum degreeRandić indexsum-connectivity index


Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40) Vertex degrees (05C07)


Related Items (8)

Some new bounds on the general sum--connectivity index ⋮ More ordering on the difference between atom-bond connectivity index and Randić index of binary trees ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The product connectivity Banhatti index of a graph ⋮ Beyond the Zagreb indices ⋮ On some bounds of the topological indices of generalized Sierpiński and extended Sierpiński graphs



Cites Work

  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Sum-connectivity index of molecular trees
  • Minimum sum-connectivity indices of trees and unicyclic graphs of a given matching number
  • On a novel connectivity index
  • On the sum-connectivity index
  • Series expansion of the directed percolation probability


This page was built for publication: Sum-connectivity index of a graph

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:256504&oldid=12145279"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 01:36.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki