zbMATH — the first resource for mathematics

Examples
Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

Operators
a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
Fields
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Cacti with minimum, second-minimum, and third-minimum Kirchhoff indices. (English) Zbl 1206.05038
Summary: Resistance distance was introduced by Klein and Randić. The Kirchhoff index $Kf(G)$ of a graph $G$ is the sum of resistance distances between all pairs of vertices. A graph $G$ is called a cactus if each block of $G$ is either an edge or a cycle. Denote by $\text{Cat}(n;t)$ the set of connected cacti possessing $n$ vertices and $t$ cycles. In this paper, we give the first three smallest Kirchhoff indices among graphs in $\text{Cat}(n;t)$, and characterize/ the corresponding extremal graphs as well.

MSC:
05C12Distance in graphs
05C90Applications of graph theory