{"title":"On some L(2, 1)-coloring parameters of certain graph classes","authors":"G. Anjali, N. Sudev","doi":"10.2478/ausi-2019-0013","DOIUrl":null,"url":null,"abstract":"Abstract Graph coloring can be considered as a random experiment with the color of a randomly selected vertex as the random variable. In this paper, we consider the L(2, 1)-coloring of G as the random experiment and we discuss the concept of two fundamental statistical parameters – mean and variance – with respect to the L(2, 1)-coloring of certain fundamental graph classes.","PeriodicalId":41480,"journal":{"name":"Acta Universitatis Sapientiae Informatica","volume":"32 1","pages":"184 - 205"},"PeriodicalIF":0.3000,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Acta Universitatis Sapientiae Informatica","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2478/ausi-2019-0013","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0
Abstract
Abstract Graph coloring can be considered as a random experiment with the color of a randomly selected vertex as the random variable. In this paper, we consider the L(2, 1)-coloring of G as the random experiment and we discuss the concept of two fundamental statistical parameters – mean and variance – with respect to the L(2, 1)-coloring of certain fundamental graph classes.