EuDML | Browse

The search session has expired. Please query the service again.

Items

All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Displaying 621 – 640 of 1341

On prime labeling of union of tadpole graphs

Sanjaykumar K. Patel, Jayesh B. Vasava (2022)

Commentationes Mathematicae Universitatis Carolinae

A graph $G$ of order $n$ is said to be a prime graph if its vertices can be labeled with the first $n$ positive integers in such a way that the labels of any two adjacent vertices in $G$ are relatively prime. If such a labeling on $G$ exists then it is called a prime labeling. In this paper we seek prime labeling for union of tadpole graphs. We derive a necessary condition for the existence of prime labelings of graphs that are union of tadpole graphs and further show that the condition is also sufficient...

On primitive 3-smooth partitions of $n$ .

Avidon, Michael R. (1997)

The Electronic Journal of Combinatorics [electronic only]

On Principal Graphs and Weak Duality.

V.S. Sunder, Uma Krishnan (1994)

Mathematica Scandinavica

On problems related to characteristic vertices of graphs

Lucjan Szamkołowicz (1979)

Colloquium Mathematicae

On products of binary relational structures

Věra Trnková (1976)

Commentationes Mathematicae Universitatis Carolinae

On Projective Plane of Order 13 with a Frobenius Group of Order 39 as a Collineation Group

Hoxha, Razim (2001)

Serdica Mathematical Journal

One of the most outstanding problems in combinatorial mathematics and geometry is the problem of existence of finite projective planes whose order is not a prime power.

On Projective Planes of Type (5, m).

Peter Lorimer (1982)

Monatshefte für Mathematik

On properties of a graph that depend on its distance function

Ladislav Nebeský (2004)

Czechoslovak Mathematical Journal

If $G$ is a connected graph with distance function $d$ , then by a step in $G$ is meant an ordered triple $(u, x, v)$ of vertices of $G$ such that $d (u, x) = 1$ and $d (u, v) = d (x, v) + 1$ . A characterization of the set of all steps in a connected graph was published by the present author in 1997. In Section 1 of this paper, a new and shorter proof of that characterization is presented. A stronger result for a certain type of connected graphs is proved in Section 2.

On properties of maximal 1-planar graphs

Dávid Hudák, Tomáš Madaras, Yusuke Suzuki (2012)

Discussiones Mathematicae Graph Theory

A graph is called 1-planar if there exists a drawing in the plane so that each edge contains at most one crossing. We study maximal 1-planar graphs from the point of view of properties of their diagrams, local structure and hamiltonicity.

On Property B and on Steiner Systems.

Hans Ludwig de Vries (1977)

Mathematische Zeitschrift

On $q$ -analogs of recursions for the number of involutions and prime order elements in symmetric groups.

Kutler, Max B., Vinroot, C.Ryan (2010)

Journal of Integer Sequences [electronic only]

On $q$ -clan geometry, $q = 2^{e}$ .

Bader, L., Lunardon, G, Payne, S.E. (1994)

Bulletin of the Belgian Mathematical Society - Simon Stevin

On q-Euler numbers, q-Salié numbers and q-Carlitz numbers

Hao Pan, Zhi-Wei Sun (2006)

Acta Arithmetica

On quasistars in $n$ -cubes

Ladislav Nebeský (1984)

Časopis pro pěstování matematiky

On $r$ -extendability of the hypercube $Q_{n}$

Nirmala B. Limaye, Dinesh G. Sarvate (1997)

Mathematica Bohemica

A graph having a perfect matching is called $r$ -extendable if every matching of size $r$ can be extended to a perfect matching. It is proved that in the hypercube $Q_{n}$ , a matching $S$ with $| S | \leq n$ can be extended to a perfect matching if and only if it does not saturate the neighbourhood of any unsaturated vertex. In particular, $Q_{n}$ is $r$ -extendable for every $r$ with $1 \leq r \leq n - 1 .$

On radially extremal digraphs

Ferdinand Gliviak, Martin Knor (1995)

Mathematica Bohemica

We define digraphs minimal, critical, and maximal by three types of radii. Some of these classes are completely characterized, while for the others it is shown that they are large in terms of induced subgraphs.

On radially extremal graphs and digraphs, a survey

Ferdinand Gliviak (2000)

Mathematica Bohemica

The paper gives an overview of results for radially minimal, critical, maximal and stable graphs and digraphs.

Currently displaying 621 – 640 of 1341

Previous Page 32 Next

Displaying 621 – 640 of 1341

On prime labeling of union of tadpole graphs

On primitive 3-smooth partitions of $n$ .

On Principal Graphs and Weak Duality.

On problems related to characteristic vertices of graphs

On products of binary relational structures

On Projective Plane of Order 13 with a Frobenius Group of Order 39 as a Collineation Group

On Projective Planes of Type (5, m).

On properties of a graph that depend on its distance function

On properties of maximal 1-planar graphs

On Property B and on Steiner Systems.

On $q$ -analogs of recursions for the number of involutions and prime order elements in symmetric groups.

On $q$ -clan geometry, $q = 2^{e}$ .

On q-Euler numbers, q-Salié numbers and q-Carlitz numbers

On quasistars in $n$ -cubes

On $r$ -extendability of the hypercube $Q_{n}$

On radially extremal digraphs

On radially extremal graphs and digraphs, a survey

On rainbow arithmetic progressions.

On rainbow connection.

On rainbow solutions to an equation with a quadratic term.

Currently displaying 621 – 640 of 1341