Results 61 to 70 of about 141,920 (188)
Minimal chordal sense of direction and circulant graphs
, 2005 A sense of direction is an edge labeling on graphs that follows a globally consistent scheme and is known to considerably reduce the complexity of several distributed problems. In this paper, we study a particular instance of sense of direction, called a
A. Ádám +15 more
core +2 more sources
, 2016 A prime labeling of a graph with $n$ vertices is a labeling of its vertices with distinct integers from $\{1, 2,\ldots , n\}$ in such a way that the labels of any two adjacent vertices are relatively prime. T. Varkey conjectured that ladder graphs have a prime labeling. We prove this conjecture.
Ghorbani, Ebrahim, Kamali, Sara
openaire +2 more sources
Binomial edge ideals and rational normal scrolls [PDF]
, 2014 Let $X$ be the Hankel matrix of size $2\times n$ and let $G$ be a closed graph on the vertex set $[n].$ We study the binomial ideal $I_G\subset K[x_1,\ldots,x_{n+1}]$ which is generated by all the $2$-minors of $X$ which correspond to the edges of $G ...
Chaudhry, Faryal +2 more
core
Some New Results on Strong Integer Additive Set-Indexers of Graphs
, 2014 Let $\mathbb{N}_0$ be the set of all non-negative integers. An integer additive set-indexer of a graph $G$ is an injective function $f:V(G)\to 2^{\mathbb{N}_0}$ such that the induced function $g_f:E(G) \rightarrow 2^{\mathbb{N}_0}$ defined by $f^+(uv ...
Germina, K. A., Sudev, N. K.
core +2 more sources
The integral monodromy of hyperelliptic and trielliptic curves
, 2006 We compute the $\integ/\ell$ and $\integ_\ell$ monodromy of every irreducible component of the moduli spaces of hyperelliptic and trielliptic curves. In particular, we provide a proof that the $\integ/\ell$ monodromy of the moduli space of hyperelliptic ...
A. Vasiu +18 more
core +2 more sources
Extending Undirected Graph Techniques to Directed Graphs via Category Theory
MathematicsWe use Category Theory to construct a ‘bridge’ relating directed graphs with undirected graphs, such that the notion of direction is preserved. Specifically, we provide an isomorphism between the category of simple directed graphs and a category we call ‘
Sebastian Pardo-Guerra +4 more
doaj +1 more source
Certain Results on Prime and Prime Distance Labeling of Graphs
Journal of Physics: Conference Series, 2020 Abstract Let G be a graph on n vertices. A bijective function f : V (G) → {1, 2,…,n} is said to be a prime labeling if for every e = xy, GCD{f (x),f (y)} = 1. A graph which permits a prime labeling is a “prime graph”. On the other hand, a graph G is a prime distance graph if there is an injective function g : V(G) → Z (the set of all ...
A. Parthiban, Ajaz Ahmad Pir, A. Felix
openaire +1 more source
Open MathematicsIn the context of a simple undirected graph GG, a kk-prime labeling refers to assigning distinct integers from the set {k,k+1,…,∣V(G)∣+k−1}\left\{k,k+1,\ldots ,| V\left(G)| +k-1\right\} to its vertices, such that adjacent vertices in GG are labeled with ...
Abughneim Omar A., Abughazaleh Baha’
doaj +1 more source
Prime labelings of infinite graphs
Involve, a Journal of Mathematics, 2019 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kenigsberg, Matthew, Levin, Oscar
openaire +2 more sources
On the Graph Isomorphism Completeness of Directed and Multidirected Graphs
MathematicsThe category of directed graphs is isomorphic to a particular category whose objects are labeled undirected bipartite graphs and whose morphisms are undirected graph morphisms that respect the labeling. Based on this isomorphism, we begin by showing that
Sebastian Pardo-Guerra +2 more
doaj +1 more source