Zobrazeno 1 - 10
of 132
pro vyhledávání: '"Sudev N. K."'
Autor:
Anjali G., Sudev N. K.
Publikováno v:
Acta Universitatis Sapientiae: Informatica, Vol 11, Iss 2, Pp 184-205 (2019)
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 s
Externí odkaz:
https://doaj.org/article/0953435059c9482b9c17ce16dbcfc519
Publikováno v:
Acta Universitatis Sapientiae: Mathematica, Vol 11, Iss 1, Pp 186-202 (2019)
Let ℕ0 be the set of all non-negative integers and 𝒫(ℕ0) be its power set. Then, an integer additive set-indexer (IASI) of a given graph G is an injective function f : V(G) → P(ℕ0) such that the induced function f+ : E(G) → 𝒫(ℕ0) de
Externí odkaz:
https://doaj.org/article/7e07e5de27744837be5974badf027f49
Publikováno v:
Contemporary Studies in Discrete Mathematics, Vol. 1, No. 1, 2017, pp. 21-30
The curling number of a graph G is defined as the number of times an element in the degree sequence of G appears the maximum. Graph colouring is an assignment of colours, labels or weights to the vertices or edges of a graph. A colouring $\mathcal{C}
Externí odkaz:
http://arxiv.org/abs/1804.01860
Publikováno v:
Contemporary Studies in Discrete Mathematics, Vol. 1, Issue 1, 2017
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
Externí odkaz:
http://arxiv.org/abs/1801.00468
Colouring the vertices of a graph $G$ according to certain conditions can be considered as a random experiment and a discrete random variable $X$ can be defined as the number of vertices having a particular colour in the proper colouring of $G$. The
Externí odkaz:
http://arxiv.org/abs/1708.01700
A vertex colouring of a given graph $G$ can be considered as a random experiment. A discrete random variable $X$, corresponding to this random experiment, can be defined as the colour of a randomly chosen vertex of $G$ and a probability mass function
Externí odkaz:
http://arxiv.org/abs/1707.00140
Colouring the vertices of a graph $G$ according to certain conditions can be considered as a random experiment and a discrete random variable $X$ can be defined as the number of vertices having a particular colour in the proper colouring of $G$. In t
Externí odkaz:
http://arxiv.org/abs/1706.02547
Autor:
Sudev, N. K.
Let $X$ be a non-empty ground set and $\mathscr{P}(X)$ be its power set. A set-labeling (or a set-valuation) of a graph $G$ is an injective set-valued function $f:V(G)\to \mathscr{P}(X)$ such that the induced function $f^*:E(G) \to \mathscr{P}(X)$ is
Externí odkaz:
http://arxiv.org/abs/1701.00190
Let $X$ be a non-empty ground set and $\mathcal{P}(X)$ be its power set. A set-labeling (or a set-valuation) of a graph $G$ is an injective set-valued function $f:V(G)\to \mathcal{P}(X)$ such that the induced function $f^\oplus:E(G) \to \mathcal{P}(X
Externí odkaz:
http://arxiv.org/abs/1610.00698
Let $X$ denotes a set of non-negative integers and $\mathscr{P}(X)$ be its power set. An integer additive set-labeling (IASL) of a graph $G$ is an injective set-valued function $f:V(G)\to \mathscr{P}(X)-\{\emptyset\}$ such that the induced function $
Externí odkaz:
http://arxiv.org/abs/1609.00295