How to Compute the M-Polynomial of (Chemical) Graphs (Q5050766): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.46793/match.89-2.275d
+Normal rank
@@ Property / OpenAlex ID @@
+W4291536575
@@ Property / OpenAlex ID: W4291536575 / rank @@
+Normal rank
@@ Property / cites work @@
+M-polynomial of some Graph Operations and Cycle Related Graphs
+Normal rank
@@ Property / cites work @@
+Extremal Unicyclic Graphs with Respect to Vertex-Degree-Based Topological Indices
+Normal rank
@@ Property / cites work @@
+M-Polynomial and Degree-Based Topological Indices
@@ Property / cites work: M-Polynomial and Degree-Based Topological Indices / rank @@
+Normal rank
@@ Property / cites work @@
+\(M\)-polynomial revisited: Bethe cacti and an extension of Gutman's approach
+Normal rank
@@ Property / cites work @@
+On the M-polynomial of planar chemical graphs
@@ Property / cites work: On the M-polynomial of planar chemical graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On structure-sensitivity of degree-based topological indices
+Normal rank
@@ Property / cites work @@
+Trees with Maximum Vertex-Degree-Based Topological Indices
+Normal rank
@@ Property / cites work @@
+Extremal Graphs for Topological Index Defined by a Degree-Based Edge-Weight Function
+Normal rank
@@ Property / cites work @@
+Graphs with Minimum Vertex-Degree Function-Index for Convex Functions
+Normal rank