Hostname: page-component-7b7567c8c-m6dxt Total loading time: 0 Render date: 2026-11-19T02:35:13.834Z Has data issue: false hasContentIssue false

Maximizing the Index of Trees with Given Domination Number

Published online by Cambridge University Press:  20 November 2018

Guangquan Guo
Affiliation:
School of Mathematical Sciences, Xinjiang Normal University, Urumqi, Xinjiang 830054, P.R.China e-mail: xj.wgp@163.com
Guoping Wang*
Affiliation:
School of Mathematical Sciences, Xinjiang Normal University, Urumqi, Xinjiang 830054, P.R.China e-mail: xj.wgp@163.com
*
G.Wang is the corresponding author.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

The index of a graph $G$ is the maximum eigenvalue of its adjacency matrix $A\left( G \right)$ . In this paper we characterize the extremal tree with given domination number that attains the maximum index.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 2014