The differential of the strong product graphs
Loading...
Identifiers
Publication date
Reading date
Event date
Start date of the public exhibition period
End date of the public exhibition period
Authors
Authors of photography
Person who provides the photography
Journal Title
Journal ISSN
Volume Title
Publisher
Taylor & Francis
Metrics
Export
Abstract
Let G = (V, E) be a graph of order n and let B(D) be the set of vertices in V \ D that have a neighbour in the set D. The differential of a set D is defined as ∂(D) = |B(D)| − |D| and the differential of a graph to equal the maximum value of ∂(D) for any subset D of V. In this paper we obtain several tight bounds for the differential of strong product graphs. In particular, we investigate the relationship between the differential of this type of product graphs and various parameters in the factors of the product.
Doctoral program
Related publication
Research projects
Description
Bibliographic reference
International Journal of Computer Mathematics, vol 92, nº 6 p. 1124-1134
Photography rights
Collections
Endorsement
Review
Supplemented By
Referenced By
Creative Commons license
Except where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivatives 4.0 International