Zobrazeno 1 - 10
of 132
pro vyhledávání: '"Sudev, N. K."'
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
The concepts of linear Jaco graphs and Jaco-type graphs have been introduced as certain types of directed graphs with specifically defined adjacency conditions. The distinct difference between a pure Jaco graph and a Jaco-type graph is that for a pur
Externí odkaz:
http://arxiv.org/abs/1608.00856
In this paper, we introduce the notion of an energy graph as a simple, directed and vertex labeled graph $G$ such that the arcs $(v_i, v_j) \notin A(G)$ if $i > j$ for all distinct pairs $v_i,v_j$ and at least one vertex $v_k$ exists such that $d^-(v
Externí odkaz:
http://arxiv.org/abs/1607.00472