Results 11 to 20 of about 116,736 (298)
On \delta^(k)-colouring of Powers of Paths and Cycles
Theory and Applications of Graphs, 2021 In a proper vertex colouring of a graph, the vertices are coloured in such a way that no two adjacent vertices receive the same colour, whereas in an improper vertex colouring, adjacent vertices are permitted to receive same colours subjected to some ...
Merlin Ellumkalayil, Sudev Naduvath
doaj +1 more source
Hamilton Paths in Dominating Graphs of Trees and Cycles [PDF]
Graphs and Combinatorics, 2021 The dominating graph of a graph H has as its vertices all dominating sets of H, with an edge between two dominating sets if one can be obtained from the other by the addition or deletion of a single vertex of H. In this paper we prove that the dominating
K. Adaricheva +6 more
semanticscholar +1 more source
Anti-Ramsey Numbers of Paths and Cycles in Hypergraphs [PDF]
SIAM Journal on Discrete Mathematics, 2019 The anti-Ramsey problem was introduced by Erd\H{o}s, Simonovits and S\'{o}s in 1970s. The anti-Ramsey number of a hypergraph $\mathcal{H}$, $ar(n,s, \mathcal{H})$, is the smallest integer $c$ such that in any coloring of the edges of the $s$-uniform ...
Ran Gu, Jiaao Li, Yongtang Shi
semanticscholar +1 more source
Broadcasts on Paths and Cycles [PDF]
Discrete Applied Mathematics, 2019 A broadcast on a graph $G=(V,E)$ is a function $f: V\longrightarrow \{0,\ldots,\operatorname{diam}(G)\}$ such that $f(v)\leq e_G(v)$ for every vertex $v\in V$, where$\operatorname{diam}(G)$ denotes the diameter of $G$ and $e_G(v)$ the eccentricity of $v$
Sabrina Bouchouika +2 more
semanticscholar +1 more source
The Optimal Rubbling Number of Paths, Cycles, and Grids
Complexity, 2021 A pebbling move on a graph G consists of the removal of two pebbles from one vertex and the placement of one pebble on an adjacent vertex. Rubbling is a version of pebbling where an additional move is allowed, which is also called the strict rubbling ...
Zheng-Jiang Xia, Zhen-Mu Hong
doaj +1 more source
On Virtual Network Embedding: Paths and Cycles [PDF]
IEEE/ACM International Symposium on Modeling, Analysis, and Simulation On Computer and Telecommunication Systems, 2018 Network virtualization provides a promising solution to overcome the ossification of current networks, allowing multiple Virtual Network Requests (VNRs) embedded on a common infrastructure.
Haitao Wu +3 more
semanticscholar +1 more source
Criticality indices of 2-rainbow domination of paths and cycles [PDF]
Opuscula Mathematica, 2016 A \(2\)-rainbow dominating function of a graph \(G\left(V(G),E(G)\right)\) is a function \(f\) that assigns to each vertex a set of colors chosen from the set \(\{1,2\}\) so that for each vertex with \(f(v)=\emptyset\) we have \({\textstyle\bigcup_{u\in ...
Ahmed Bouchou, Mostafa Blidia
doaj +1 more source
Characterization of signed paths and cycles admitting minus dominating function [PDF]
Communications in Combinatorics and Optimization, 2020 Let $G=(V,E,\sigma)$ be a finite signed graph. A function $f: V \rightarrow\{-1,0,1\}$ is a minus dominating function (MDF) of $ G $ if $f(u)+\sum_{v \in N(u)} \sigma (uv)f(v)\geq 1 $ for all $ u\in V $. In this paper we characterize signed paths and
S.R. Shreyas, M. Joseph
doaj +1 more source
Counting arithmetical structures on paths and cycles [PDF]
Discrete Mathematics, 2017 Let G be a finite, connected graph. An arithmetical structure on G is a pair of positive integer vectors d , r such that ( diag ( d ) − A ) r = 0 , where A is the adjacency matrix of G . We investigate the combinatorics of arithmetical structures on path
Benjamin Braun +8 more
semanticscholar +1 more source
On Virtual Network Embedding: Paths and Cycles
IEEE Transactions on Network and Service Management, 2020 Network virtualization provides a promising solution to overcome the ossification of current networks, allowing multiple Virtual Network Requests (VNRs) to be embedded on a common infrastructure.
Haitao Wu +3 more
semanticscholar +1 more source