RO EN
Maximum nontrivial convex cover number of join and corona of graphs
Authors: Radu Buzatu
– 0.11 Mb
Abstract
Let $G$ be a connected graph. We say that a set $S\subseteq X(G)$ is convex in $G$ if, for any two vertices $x,y\in S$, all vertices of every shortest path between $x$ and $y$ are in $S$. If $3\leq|S|\leq|X(G)|-1$, then $S$ is a nontrivial set. The greatest $p\geq2$ for which there is a cover of $G$ by $p$ nontrivial and convex sets is the maximum nontrivial convex cover number of $G$. In this paper, we determine the maximum nontrivial convex cover number of join and corona of graphs.Moldova State University
60 A. Mateevici, MD-2009,
Chisinau, Republic of Moldova
E-mail: ,
60 A. Mateevici, MD-2009,
Chisinau, Republic of Moldova
E-mail: ,
Fulltext
– 0.11 Mb
Contents
- An iterative method for solving split minimization problem in Banach space with applications
- Homogenization of a lubrication problem in oscillating domain by two-scale convergence method
- Local growth of solutions of linear differential equations with analytic
- On non-discrete topologization of some countable skew fields
- Maximum nontrivial convex cover number of join and corona of graphs
- Algebraic View over Homogeneous Linear Recurrent Processes
- Localization of singular points of meromorphic functions based on interpolation by rational functions
- Postoptimal analysis of a finite cooperative game
