Vector weighted Stirling numbers and an application in graph theory

Vector weighted Stirling numbers and an application in graph theory

We introduce \textit{vector weighted Stirling numbers}, which are a generalization of ordinary Stirling numbers and restricted Stirling numbers. Some relations between vector weighted Stirling numbers and ordinary Stirling numbers and some of their applications are stated. Moreover, as an applicatio...

Full description

Saved in:
Bibliographic Details
Main Authors: Esmaeeli, Fahimeh; Department of Pure Mathematics, Ferdowsi University of Mashhad, Mashhad, I.R. Iran (Author), Erfanian, Ahmad; Department of Pure Mathematics and The Center of Excellence in Analysis on Algebraic Structures, Ferdowsi University of Mashhad, Mashhad, I. R. Iran (Author), Mirzavaziri, Madjid; Department of Pure Mathematics and The Center of Excellence in Analysis on Algebraic Structures, Ferdowsi University of Mashhad, Mashhad, I. R. Iran (Author)
Format: EJournal Article
Published: GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB, 2021-04-15.
Subjects:
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
Online Access:Get Fulltext
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We introduce \textit{vector weighted Stirling numbers}, which are a generalization of ordinary Stirling numbers and restricted Stirling numbers. Some relations between vector weighted Stirling numbers and ordinary Stirling numbers and some of their applications are stated. Moreover, as an application of vector weighted Stirling numbers of the second kind in graph theory, we compute the number of maximal independent sets of different sizes in k-intersection graphs.
Item Description:https://www.ejgta.org/index.php/ejgta/article/view/1180

Similar Items