Previous Page 2

Displaying 21 – 25 of 25

Showing per page

Spectral properties of a certain class of Carleman operators

S. M. Bahri (2007)

Archivum Mathematicum

The object of the present work is to construct all the generalized spectral functions of a certain class of Carleman operators in the Hilbert space L 2 X , μ and establish the corresponding expansion theorems, when the deficiency indices are (1,1). This is done by constructing the generalized resolvents of A and then using the Stieltjes inversion formula.

Stronger bounds for generalized degrees and Menger path systems

R.J. Faudree, Zs. Tuza (1995)

Discussiones Mathematicae Graph Theory

For positive integers d and m, let P d , m ( G ) denote the property that between each pair of vertices of the graph G, there are m internally vertex disjoint paths of length at most d. For a positive integer t a graph G satisfies the minimum generalized degree condition δₜ(G) ≥ s if the cardinality of the union of the neighborhoods of each set of t vertices of G is at least s. Generalized degree conditions that ensure that P d , m ( G ) is satisfied have been investigated. In particular, it has been shown, for fixed positive...

Strongly pancyclic and dual-pancyclic graphs

Terry A. McKee (2009)

Discussiones Mathematicae Graph Theory

Say that a cycle C almost contains a cycle C¯ if every edge except one of C¯ is an edge of C. Call a graph G strongly pancyclic if every nontriangular cycle C almost contains another cycle C¯ and every nonspanning cycle C is almost contained in another cycle C⁺. This is equivalent to requiring, in addition, that the sizes of C¯ and C⁺ differ by one from the size of C. Strongly pancyclic graphs are pancyclic and chordal, and their cycles enjoy certain interpolation and extrapolation properties with...

Survey of certain valuations of graphs

Martin Bača, J.A. MacDougall, Mirka Miller, Slamin, W.D. Wallis (2000)

Discussiones Mathematicae Graph Theory

The study of valuations of graphs is a relatively young part of graph theory. In this article we survey what is known about certain graph valuations, that is, labeling methods: antimagic labelings, edge-magic total labelings and vertex-magic total labelings.

Currently displaying 21 – 25 of 25

Previous Page 2