Schreyer, Jens; Walther, Hansjoachim; Mel'nikov, Leonid S.
Vertex-oblique graphs. - In: Discrete mathematics, Bd. 307 (2007), 11/12, S. 1538-1544
http://dx.doi.org/10.1016/j.disc.2005.11.091
Vertex-oblique graphs. - In: Discrete mathematics, Bd. 307 (2007), 11/12, S. 1538-1544
Let x be a vertex of a simple graph G. The vertex-type of x is the lexicographically ordered degree sequence of its neighbors. We call the graph G vertex-oblique if there are no two vertices in V(G) which are of the same vertex-type. We will show that the set of vertex-oblique graphs of arbitrary connectivity is infinite.
http://dx.doi.org/10.1016/j.disc.2005.11.091
Ilchmann, Achim;
Schuster, Hans
PI-funnel control for two mass systems. - Ilmenau : Techn. Univ., Inst. für Mathematik, 2007. - 18 S. = 438,2 KB. - (Preprint ; M07,02)
http://www.db-thueringen.de/servlets/DocumentServlet?id=8314
PI-funnel control for two mass systems. - Ilmenau : Techn. Univ., Inst. für Mathematik, 2007. - 18 S. = 438,2 KB. - (Preprint ; M07,02)
http://www.db-thueringen.de/servlets/DocumentServlet?id=8314
Ilchmann, Achim;
Logemann, Hartmut; Ryan, Eugene P.
Tracking with prescribed transient performance for hysteretic systems. - Ilmenau : Techn. Univ., Inst. für Mathematik, 2007. - 20 S. = 347,0 KB. - (Preprint ; M07,01)
http://www.db-thueringen.de/servlets/DocumentServlet?id=8312
Tracking with prescribed transient performance for hysteretic systems. - Ilmenau : Techn. Univ., Inst. für Mathematik, 2007. - 20 S. = 347,0 KB. - (Preprint ; M07,01)
http://www.db-thueringen.de/servlets/DocumentServlet?id=8312
Rautenbach, Dieter; Volkmann, Lutz
New bounds on the k-domination number and the k-tuple domination number. - In: Applied mathematics letters, Bd. 20 (2007), 1, S. 98-102
http://dx.doi.org/10.1016/j.aml.2006.03.006
New bounds on the k-domination number and the k-tuple domination number. - In: Applied mathematics letters, Bd. 20 (2007), 1, S. 98-102
http://dx.doi.org/10.1016/j.aml.2006.03.006
Maffray, Frédéric; Rautenbach, Dieter
Small step-dominating sets in trees. - In: Discrete mathematics, Bd. 307 (2007), 9/10, S. 1212-1215
http://dx.doi.org/10.1016/j.disc.2006.07.038
Small step-dominating sets in trees. - In: Discrete mathematics, Bd. 307 (2007), 9/10, S. 1212-1215
http://dx.doi.org/10.1016/j.disc.2006.07.038
Rautenbach, Dieter;
Szegedy, Christian; Szegedy, Christian *1971-*; Werber, Jürgen
The delay of circuits whose inputs have specified arrival times. - In: Discrete applied mathematics, ISSN 1872-6771, Bd. 155 (2007), 10, S. 1233-1243
https://doi.org/10.1016/j.dam.2006.10.013
The delay of circuits whose inputs have specified arrival times. - In: Discrete applied mathematics, ISSN 1872-6771, Bd. 155 (2007), 10, S. 1233-1243
https://doi.org/10.1016/j.dam.2006.10.013
Henning, Michael A.; Rautenbach, Dieter
On the irregularity of bipartite graphs. - In: Discrete mathematics, Bd. 307 (2007), 11/12, S. 1467-1472
http://dx.doi.org/10.1016/j.disc.2006.09.038
On the irregularity of bipartite graphs. - In: Discrete mathematics, Bd. 307 (2007), 11/12, S. 1467-1472
http://dx.doi.org/10.1016/j.disc.2006.09.038
Caro, Yair; Rautenbach, Dieter
Reconstructing graphs from size and degree properties of their induced k-subgraphs. - In: Discrete mathematics, Bd. 307 (2007), 6, S. 694-703
http://dx.doi.org/10.1016/j.disc.2006.06.031
Reconstructing graphs from size and degree properties of their induced k-subgraphs. - In: Discrete mathematics, Bd. 307 (2007), 6, S. 694-703
http://dx.doi.org/10.1016/j.disc.2006.06.031
Gerlach, Tobias;
Harant, Jochen;
On a cycle through a specified linear forest of a graph. - In: Discrete mathematics, Bd. 307 (2007), 7/8, S. 892-895
http://dx.doi.org/10.1016/j.disc.2005.11.043
On a cycle through a specified linear forest of a graph. - In: Discrete mathematics, Bd. 307 (2007), 7/8, S. 892-895
http://dx.doi.org/10.1016/j.disc.2005.11.043
Hexel, Erhard;
On short paths through prescribed vertices of a graph. - In: Discrete mathematics, Bd. 307 (2007), 7/8, S. 905-910
http://dx.doi.org/10.1016/j.disc.2005.11.040
On short paths through prescribed vertices of a graph. - In: Discrete mathematics, Bd. 307 (2007), 7/8, S. 905-910
http://dx.doi.org/10.1016/j.disc.2005.11.040