The Experts below are selected from a list of 78 Experts worldwide ranked by ideXlab platform
Sudev Naduvath - One of the best experts on this subject based on the ideXlab platform.
-
Injective coloring parameters of some special classes of graphs
Research & Reviews: Discrete Mathematical Structures, 2019Co-Authors: Sudev Naduvath, V Santhosh PriyaAbstract:The vertex coloring of a graph can be viewed as a Random Experiment and with respect to this Experiment, a Random variable X can be defined such that X denotes the color of an arbitrarily chosen vertex. In this paper, we broaden the ideas of coloring mean and variance of graphs with respect to a particular type of proper injective coloring and determine these parameters for some standard graph classes.
-
ON -COLORING PARAMETERS OF SOME CLASSES OF GRAPHS
Research & Reviews: Discrete Mathematical Structures, 2019Co-Authors: Sudev Naduvath, M Raksha, P Hithavarshini, C DominicAbstract:Vertex coloring has always been a topic of interest. Motivated by the studies on-chromatic mean and variance of some standard graphs, in this paper, we obtain few results for-chromatic and +-chromatic mean and variance of some cycle related graph classes. Here, Vertex coloring of a graph is taken to be the Random Experiment. Discrete Random variable for this Random Experiment is the color of Randomly chosen vertex of .
-
ON EQUITABLE COLORING PARAMETERS OF CERTAIN WHEEL RELATED GRAPHS
CONTEMPORARY STUDIES IN DISCRETE MATHEMATICS, 2017Co-Authors: Sudev Naduvath, K Chithra, E ShinyAbstract:Coloring the vertices of a graph G subject to given conditions can be considered as a Random Experiment and corresponding to this Experiment, a discrete Random variable X can be defined as the colour of a vertex chosen at Random, with respect to the given type of coloring of G and a probability mass function for this Random variable can be defined accordingly. A proper coloring C of a graph G, which assigns colors to the vertices of G such that the numbers of vertices in any two color classes differ by at most one, is called an equitable colouring of G. In this paper, we study two statistical parameters of certain cycle related graphs, with respect to their equitable colorings.
C Dominic - One of the best experts on this subject based on the ideXlab platform.
-
ON -COLORING PARAMETERS OF SOME CLASSES OF GRAPHS
Research & Reviews: Discrete Mathematical Structures, 2019Co-Authors: Sudev Naduvath, M Raksha, P Hithavarshini, C DominicAbstract:Vertex coloring has always been a topic of interest. Motivated by the studies on-chromatic mean and variance of some standard graphs, in this paper, we obtain few results for-chromatic and +-chromatic mean and variance of some cycle related graph classes. Here, Vertex coloring of a graph is taken to be the Random Experiment. Discrete Random variable for this Random Experiment is the color of Randomly chosen vertex of .
V Santhosh Priya - One of the best experts on this subject based on the ideXlab platform.
-
Injective coloring parameters of some special classes of graphs
Research & Reviews: Discrete Mathematical Structures, 2019Co-Authors: Sudev Naduvath, V Santhosh PriyaAbstract:The vertex coloring of a graph can be viewed as a Random Experiment and with respect to this Experiment, a Random variable X can be defined such that X denotes the color of an arbitrarily chosen vertex. In this paper, we broaden the ideas of coloring mean and variance of graphs with respect to a particular type of proper injective coloring and determine these parameters for some standard graph classes.
E Shiny - One of the best experts on this subject based on the ideXlab platform.
-
ON EQUITABLE COLORING PARAMETERS OF CERTAIN WHEEL RELATED GRAPHS
CONTEMPORARY STUDIES IN DISCRETE MATHEMATICS, 2017Co-Authors: Sudev Naduvath, K Chithra, E ShinyAbstract:Coloring the vertices of a graph G subject to given conditions can be considered as a Random Experiment and corresponding to this Experiment, a discrete Random variable X can be defined as the colour of a vertex chosen at Random, with respect to the given type of coloring of G and a probability mass function for this Random variable can be defined accordingly. A proper coloring C of a graph G, which assigns colors to the vertices of G such that the numbers of vertices in any two color classes differ by at most one, is called an equitable colouring of G. In this paper, we study two statistical parameters of certain cycle related graphs, with respect to their equitable colorings.
Isaac M. Sonin - One of the best experts on this subject based on the ideXlab platform.
-
Independent Events in a Simple Random Experiment and the Meaning of Independence
arXiv: Probability, 2012Co-Authors: Isaac M. SoninAbstract:We count the number and patterns of pairs and tuples of independent events in a simple Random Experiment: first a fair coin is flipped and then a fair die is tossed. The first number, equal to 888,888, suggest that there are some open questions about the structure of independence even in a finite sample space. We discuss briefly these questions and possible approaches to answer them.
