General multiplicative Zagreb indices of trees and unicyclic graphs with given matching number

Tomáš Vetrík; Selvaraj Balachandran

doi:10.1007/s10878-020-00643-8

ScienceGate Book Chapters

JOURNAL ARTICLE

General multiplicative Zagreb indices of trees and unicyclic graphs with given matching number

Tomáš Vetrík Selvaraj Balachandran

Year: 2020 Journal: Journal of Combinatorial Optimization Vol: 40 (4)Pages: 953-973 Publisher: Springer Science+Business Media

DOI: 10.1007/s10878-020-00643-8

Get Full-Text PDF Get Analytical Report

Keywords:

Combinatorics Mathematics Multiplicative function Vertex (graph theory) Upper and lower bounds Matching (statistics) Graph Discrete mathematics Statistics

Metrics

Cited By

0.70

FWCI (Field Weighted Citation Impact)

Refs

0.70

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Graph theory and applications

Physical Sciences → Mathematics → Geometry and Topology

Synthesis and Properties of Aromatic Compounds

Physical Sciences → Chemistry → Organic Chemistry

Molecular spectroscopy and chirality

Physical Sciences → Chemistry → Spectroscopy

General multiplicative Zagreb indices of trees and unicyclic graphs with given matching number

Metrics

Citation History

Topics

Related Documents

General multiplicative Zagreb indices of unicyclic graphs

General multiplicative Zagreb indices of graphs with given clique number

General multiplicative Zagreb indices of trees with given independence number

Zagreb Indices of Trees, Unicyclic and Bicyclic Graphs With Given (Total) Domination

Extremal quasi-unicyclic graphs with respect to the general multiplicative Zagreb indices