View in EDS

Proper Injective Coloring Parameters of Some Wheel-Related Graphs.

Saved in:
Bibliographic Details
Title: Proper Injective Coloring Parameters of Some Wheel-Related Graphs.
Authors: Madhumitha, S.1 (AUTHOR) s.madhumitha@res.christuniversity.in, Naduvath, Sudev1 (AUTHOR) sudev.nk@christuniversity.in
Source: Journal of Interconnection Networks. Sep2026, Vol. 26 Issue 3, p1-24. 24p.
Subjects: Graph theory, Graph coloring
Abstract: Any vertex coloring protocol of a graph can be viewed as a random experiment of assigning colors to the vertices, such that the random variable of this experiment is the number of vertices given a specific color in that coloring. Based on this, the statistical parameters of mean and variance have been extended as the chromatic mean and chromatic variance for various vertex colorings of graphs, in the literature. In this paper, the chromatic mean and chromatic variance of graphs with respect to its proper injective coloring are investigated for certain wheel-related graphs, by determining the optimal injective coloring pattern for the graphs with optimal chromatic sum. [ABSTRACT FROM AUTHOR]
Copyright of Journal of Interconnection Networks is the property of World Scientific Publishing Company and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
FullText Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 193655370
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Proper Injective Coloring Parameters of Some Wheel-Related Graphs.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Madhumitha%2C+S%2E%22">Madhumitha, S.</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> s.madhumitha@res.christuniversity.in</i><br /><searchLink fieldCode="AR" term="%22Naduvath%2C+Sudev%22">Naduvath, Sudev</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> sudev.nk@christuniversity.in</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Journal+of+Interconnection+Networks%22">Journal of Interconnection Networks</searchLink>. Sep2026, Vol. 26 Issue 3, p1-24. 24p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Graph+theory%22">Graph theory</searchLink><br /><searchLink fieldCode="DE" term="%22Graph+coloring%22">Graph coloring</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: Any vertex coloring protocol of a graph can be viewed as a random experiment of assigning colors to the vertices, such that the random variable of this experiment is the number of vertices given a specific color in that coloring. Based on this, the statistical parameters of mean and variance have been extended as the chromatic mean and chromatic variance for various vertex colorings of graphs, in the literature. In this paper, the chromatic mean and chromatic variance of graphs with respect to its proper injective coloring are investigated for certain wheel-related graphs, by determining the optimal injective coloring pattern for the graphs with optimal chromatic sum. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Journal of Interconnection Networks is the property of World Scientific Publishing Company and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=193655370
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1142/S0219265925500094
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 24
        StartPage: 1
    Subjects:
      – SubjectFull: Graph theory
        Type: general
      – SubjectFull: Graph coloring
        Type: general
    Titles:
      – TitleFull: Proper Injective Coloring Parameters of Some Wheel-Related Graphs.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Madhumitha, S.
      – PersonEntity:
          Name:
            NameFull: Naduvath, Sudev
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 09
              Text: Sep2026
              Type: published
              Y: 2026
          Identifiers:
            – Type: issn-print
              Value: 02192659
          Numbering:
            – Type: volume
              Value: 26
            – Type: issue
              Value: 3
          Titles:
            – TitleFull: Journal of Interconnection Networks
              Type: main
ResultId 1