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

Previous Page 2

Displaying 21 – 34 of 34

Congruence classes of orientable 2-cell embeddings of bouquets of circles and dipoles.

Feng, Yan-Quan, Kwak, Jin-Ho, Zhou, Jin-Xin (2010)

The Electronic Journal of Combinatorics [electronic only]

Conjugacy of Coxeter elements.

Eriksson, Henrik, Eriksson, Kimmo (2009)

The Electronic Journal of Combinatorics [electronic only]

Connected resolvability of graphs

Varaporn Saenpholphat, Ping Zhang (2003)

Czechoslovak Mathematical Journal

For an ordered set $W = {w_{1}, w_{2}, \dots, w_{k}}$ of vertices and a vertex $v$ in a connected graph $G$ , the representation of $v$ with respect to $W$ is the $k$ -vector $r (v | W)$ = ( $d (v, w_{1})$ , $d (v, w_{2}), \dots, d (v, w_{k}))$ , where $d (x, y)$ represents the distance between the vertices $x$ and $y$ . The set $W$ is a resolving set for $G$ if distinct vertices of $G$ have distinct representations with respect to $W$ . A resolving set for $G$ containing a minimum number of vertices is a basis for $G$ . The dimension $dim (G)$ is the number of vertices in a basis for $G$ . A resolving set $W$ of $G$ is connected if the subgraph...

Connection on differential modules

Kazimierz Cegiełka (1984)

Banach Center Publications

Connectivity and planarity of Cayley graphs.

Droms, Carl, Servatius, Brigitte, Servatius, Herman (1998)

Beiträge zur Algebra und Geometrie

Consistent cycles in 1/2-arc-transitive graphs.

Boben, Marko, Miklavic, Stefko, Potocnik, Primoz (2009)

The Electronic Journal of Combinatorics [electronic only]

Constructing regular maps and graphs from planar quotients

Stanislav Jendroľ, Roman Nedela, Martin Škoviera (1997)

Mathematica Slovaca

Construction of finite $p$ -groups with prescribed group of noncentral automorphisms

Panagiotis C. Soules (1986)

Rendiconti del Seminario Matematico della Università di Padova

Constructions for cubic graphs with large girth.

Biggs, Norman (1998)

The Electronic Journal of Combinatorics [electronic only]

Correction: “The smallest graph whose group is cyclic”

Frank Harary, Edgar M. Palmer (1972)

Czechoslovak Mathematical Journal

Coxeter polynomials of Salem trees

Charalampos A. Evripidou (2015)

Colloquium Mathematicae

We compute the Coxeter polynomial of a family of Salem trees, and also the limit of the spectral radii of their Coxeter transformations as the number of their vertices tends to infinity. We also prove that if z is a root of multiplicities $m ₁, . . ., m_{k}$ for the Coxeter polynomials of the trees $₁, . . .,_{k}$ respectively, then z is a root for the Coxeter polynomial of their join, of multiplicity at least $m i n m - m ₁, . . ., m - m_{k}$ where $m = m ₁ + \dots + m_{k}$ .

Currently displaying 21 – 34 of 34

Previous Page 2

Displaying 21 – 34 of 34

Congruence classes of orientable 2-cell embeddings of bouquets of circles and dipoles.

Conjugacy of Coxeter elements.

Connected resolvability of graphs

Connection on differential modules

Connectivity and planarity of Cayley graphs.

Consistent cycles in 1/2-arc-transitive graphs.

Constructing regular maps and graphs from planar quotients

Construction of finite $p$ -groups with prescribed group of noncentral automorphisms

Constructions for cubic graphs with large girth.

Correction: “The smallest graph whose group is cyclic”

Coxeter polynomials of Salem trees

Cubic Cayley graphs with small diameter.

Cubic edge-transitive graphs of order $4 p^{2}$ .

Cycles and bipartite graph on conjugacy class of groups

Currently displaying 21 – 34 of 34