Results 41 to 50 of about 1,632,039 (225)
‘Ten Years Ahead of His Time’: The East End Elegance of Martin Peters [PDF]
Martin Peters was a successful footballer whose public persona matched the way he played the game, without fuss or fanfare. A key English player of the 1960s, he does not usually feature in discussions about the connection between fashion and football in
Hughson, John Ewing
core +1 more source
Strong Integer Additive Set-valued Graphs: A Creative Review [PDF]
For a non-empty ground set $X$, finite or infinite, the {\em set-valuation} or {\em set-labeling} of a given graph $G$ is an injective function $f:V(G) \to \mathcal{P}(X)$, where $\mathcal{P}(X)$ is the power set of the set $X$. A set-indexer of a graph $
K. A. Germina +3 more
core +1 more source
Computer search for graceful labeling: a survey [PDF]
Ljiljana Branković, Michael J. Reynolds
openalex +1 more source
Graceful and Odd Graceful Labeling of Some Graphs
In this paper, we prove that the square graph of bistar Bn,n, the splitting graph of Bn,n and the splitting graph of star K1,n are graceful graphs. We also prove that the splitting graph and the shadow graph of bistar Bn,n admit odd graceful labeling.
N. H. Shah, S. K. Vaidya
openaire +1 more source
Translation-based Constraint Answer Set Solving [PDF]
We solve constraint satisfaction problems through translation to answer set programming (ASP). Our reformulations have the property that unit-propagation in the ASP solver achieves well defined local consistency properties like arc, bound and range ...
Drescher, Christian, Walsh, Toby
core +2 more sources
An evaluation on the gracefulness and colouring of graphs [PDF]
In this thesis we shall introduce two interesting topics from graph theory and begin to explore what happens when we combine these together. We will be focusing on an area known as graph colouring and assessing it alongside a very unique set of graphs ...
Dhami, Kymrun K.
core
A Characterisation of Weak Integer Additive Set-Indexers of Graphs [PDF]
An integer additive set-indexer is defined as an injective function $f:V(G)\rightarrow 2^{\mathbb{N}_0}$ such that the induced function $g_f:E(G) \rightarrow 2^{\mathbb{N}_0}$ defined by $g_f (uv) = f(u)+ f(v)$ is also injective.
Germina, K A, Sudev, N K
core +4 more sources
Graceful Labeling For bipartite graceful Graphs and related Graphs
The concept of graceful labels was proposed by Rosa, scholars began to study graceful labels of various graphs and obtained relevant results.Let the graph is a bipartite graceful graph, we have proved some graphs are graceful labeling in this paper.
Liu, Chunfeng +2 more
openaire +2 more sources
On Integer Additive Set-Indexers of Graphs [PDF]
A set-indexer of a graph $G$ is an injective set-valued function $f:V(G) \rightarrow2^{X}$ such that the function $f^{\oplus}:E(G)\rightarrow2^{X}-\{\emptyset\}$ defined by $f^{\oplus}(uv) = f(u){\oplus} f(v)$ for every $uv{\in} E(G)$ is also injective ...
Germina, K. A., Sudev, N. K.
core +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source

