Zobrazeno 1 - 10
of 20
pro vyhledávání: '"05C78, 05C25"'
Autor:
Fernández, Blas, Maleki, Roghayeh, Miklavič, Štefko, Razafimahatratra, Andriaherimanana Sarobidy
Let $\Gamma=(V,E)$ be a graph of order $n$. A {\em closed distance magic labeling} of $\Gamma$ is a bijection $\ell : V \to \{1,2, \ldots, n\}$ for which there exists a positive integer $r$ such that $\sum_{x \in N[u]} \ell(x) = r$ for all vertices $
Externí odkaz:
http://arxiv.org/abs/2212.12441
In 1965, Erd\H{o}s and P\'{o}sa proved that there is a duality between the maximum size of a packing of cycles and the minimum size of a vertex set hitting all cycles. Such a duality does not hold for odd cycles, and Dejter and Neumann-Lara asked in
Externí odkaz:
http://arxiv.org/abs/2209.09488
Erd\H{o}s and P\'{o}sa proved in 1965 that there is a duality between the maximum size of a packing of cycles and the minimum size of a vertex set hitting all cycles. Such a duality does not hold if we restrict to odd cycles. However, in 1999, Reed p
Externí odkaz:
http://arxiv.org/abs/2102.01986
Autor:
Prajeesh, A V, Paramasivam, Krishnan
Publikováno v:
Contributions to Discrete Mathematics, 16(1), 2021
In this paper, we provide few results on the group distance magic labeling of lexicographic product and direct product of two graphs. We also prove some necessary conditions for a graph to be group distance magic and provide a characterization for a
Externí odkaz:
http://arxiv.org/abs/1808.01631
Publikováno v:
Pacific J. Math. 304 (2020) 385-400
We study {\em generalized graph splines,} introduced by Gilbert, Viel, and the last author. For a large class of rings, we characterize the graphs that only admit constant splines. To do this, we prove that if a graph has a particular type of cutset
Externí odkaz:
http://arxiv.org/abs/1807.11515
In 2009, Kong, Wang, and Lee introduced the problem of finding the edge-balanced index sets ($EBI$) of complete bipartite graphs $K_{m,n}$, where they examined the cases $n=1$, $2$, $3$, $4$, $5$ and the case $m=n$. Since then the problem of finding
Externí odkaz:
http://arxiv.org/abs/1509.01841
Autor:
Hua, Hung, Raridan, Christopher
In 2009, Kong, Wang, and Lee began work on the problem of finding the edge-balanced index sets of complete bipartite graphs $K_{m,n}$ by solving the cases where $n=1$, $2$, $3$, $4$, and $5$, and also the case where $m=n$. In an article soon to be pu
Externí odkaz:
http://arxiv.org/abs/1405.1673
In 2009, Kong, Wang, and Lee began work on the problem of finding the edge-balanced index sets (EBI) of complete bipartite graphs K_{m,n} by solving the cases where n = 1, 2, 3, 4, and 5, and also the case where m = n. In 2011, Krop and Sikes expande
Externí odkaz:
http://arxiv.org/abs/1307.8071
Let $G$ be a graph with vertex set V and edge set E such that |V| = p and |E| = q. For integers k\geq 0, define an edge labeling f : E \rightarrow \{k,k+1,....,k+q-1\} and define the vertex sum for a vertex $v$ as the sum of the labels of the edges i
Externí odkaz:
http://arxiv.org/abs/1207.2977
We study the {\sc Graph Relabeling Problem}--given an undirected, connected, simple graph $G = (V,E)$, two labelings $L$ and $L'$ of $G$, and label {\em flip} or {\em mutation} functions determine the complexity of transforming or evolving the labeli
Externí odkaz:
http://arxiv.org/abs/0809.2236