Publication:
The differential of the strong product graphs

dc.contributor.authorBermudo Navarrete, Sergio
dc.contributor.authorDe la Torre, L.
dc.contributor.authorMartín Caraballo, Ana M.
dc.contributor.authorSigarreta, J.M.
dc.date.accessioned2026-02-26T12:41:11Z
dc.date.available2026-02-26T12:41:11Z
dc.date.issued2014-07-28
dc.description.abstractLet 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.
dc.description.sponsorshipEconomía, Métodos Cuantitativos e Historia Económica
dc.format.mimetypeapplication/pdf
dc.identifier.citationInternational Journal of Computer Mathematics, vol 92, nº 6 p. 1124-1134
dc.identifier.doi10.1080/00207160.2014.941359
dc.identifier.issn1124-1134
dc.identifier.urihttps://hdl.handle.net/10433/26273
dc.language.isoen
dc.publisherTaylor & Francis
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 Internationalen
dc.rights.accessRightsrestricted access
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/
dc.subjectDifferential
dc.subjectDomination
dc.subjectStrong product graphs
dc.titleThe differential of the strong product graphs
dc.typejournal article
dc.type.hasVersionVoR
dspace.entity.typePublication
relation.isAuthorOfPublicationdbf454aa-e7ce-4350-a7a6-1510483e0026
relation.isAuthorOfPublication48e16ebb-17a5-4de4-8bf1-7fedb2e242c1
relation.isAuthorOfPublication.latestForDiscoverydbf454aa-e7ce-4350-a7a6-1510483e0026

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
The differential of the strong product graphs.pdf
Size:
444.78 KB
Format:
Adobe Portable Document Format