![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Article
The Lower and Upper Bounds of Turán Number for Odd Wheels
The Turán number for a graph H, denoted by \(\text {ex}(n,H)\) ex
-
Article
Lambda number for the direct product of some family of graphs
An L(2, 1)-labeling for a graph \(G=(V,E)\) G ...
-
Article
\(L(1,1)\) -labelling of the direct product of a complete graph and a cycle
An \(L(j,k)\) L ( ...
-
Article
Radio number for the product of a path and a complete graph
A multilevel distance labeling of a graph \(G=(V,E)\) ...
-
Article
Minimum orders of eulerian oriented digraphs with given diameter
A digraph D is oriented if it does not contain 2-cycles. If an oriented digraph D has a directed eulerian path, it is an oriented eulerian digraph. In this paper, when an oriented eulerian digraph D has minimum o...