Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Proper Injective Coloring Parameters of Some Wheel-Related Graphs
View through CrossRef
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.
World Scientific Pub Co Pte Ltd
Title: Proper Injective Coloring Parameters of Some Wheel-Related Graphs
Description:
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.
Related Results
Injective edge coloring of product graphs and some complexity results
Injective edge coloring of product graphs and some complexity results
Three edges e1, e2 and e3 in a graph G are consecutive if they form a cycle
of length 3 or a path in this order. A k-injective edge coloring of a graph
G is an edge coloring ...
On Closed Quasi Principally Injective Acts over Monoids
On Closed Quasi Principally Injective Acts over Monoids
The concept of closed quasi principally injective acts over monoids is introduced ,which signifies a generalization for the quasi principally injective as well as for the closed qu...
Generalizations of principally quasi‐injective modules and quasiprincipally injective modules
Generalizations of principally quasi‐injective modules and quasiprincipally injective modules
Let R be a ring and M a right R‐module with
S = End(MR). The module M is called almost principally
quasi‐injective (or APQ‐injective for short) if, for any m ∈ M, there exists an S...
Vibration analysis of running wheel for straddle monorail vehicles
Vibration analysis of running wheel for straddle monorail vehicles
Abstract
This article is based on the tire six component force test and wheel hub fatigue test of a certain type of straddle monorail vehicle, and analyzes the reasons for ...
Abnormal analysis of wheel hub of a straddle monorail vehicle
Abnormal analysis of wheel hub of a straddle monorail vehicle
Abstract
This article is based on the tire six component force test and wheel hub fatigue test of a certain type of straddle monorail vehicle, and analyzes the reasons for ...
KAJIAN KEINJEKTIFAN MODUL (MODUL INJEKTIF, MODUL INJEKTIF LEMAH, MODUL MININJEKTIF)
KAJIAN KEINJEKTIFAN MODUL (MODUL INJEKTIF, MODUL INJEKTIF LEMAH, MODUL MININJEKTIF)
Abstrak. Diberikan ÃÂ adalah -modul. Modul ÃÂ dikatakan injektif jika untuk setiap monomorfismaÃÂ ÃÂ dan setiap homomorfisma ÃÂ terdapat homomorfismaÃÂ ÃÂ sedemikian hingg...
Some Results on AWN-injective Rings
Some Results on AWN-injective Rings
A concept of AWN-injective ring is defined by [1], that is, for any there exists and an Y-sub module of ( is aright -module) such that and as left S-module with S=End(u ). ...
BILANGAN KROMATIK EQUITABLE PADA GRAF BINTANG, GRAF LOLIPOP, DAN GRAF PERSAHABATAN
BILANGAN KROMATIK EQUITABLE PADA GRAF BINTANG, GRAF LOLIPOP, DAN GRAF PERSAHABATAN
Let G be a connected and undirected graph. Vertex coloring in a graph G is a mapping from the set of vertices in G to the set of colors such that every two adjacent vertices have d...