TITLE

PAIRED DOMINATION IN PRISMS OF GRAPHS

AUTHOR(S)
MYNHARDT, CHRISTINA M.; SCHURCH, MARK
PUB. DATE
January 2011
SOURCE
Discussiones Mathematicae: Graph Theory;2011, Vol. 31 Issue 1, p5
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
No abstract available.
ACCESSION #
60008972

 

Related Articles

  • DISTANCE INDEPENDENCE IN GRAPHS. SEWELL, J. LOUIS; SLATER, PETER J. // Discussiones Mathematicae: Graph Theory;2011, Vol. 31 Issue 2, p397 

    No abstract available.

  • A CHARACTERIZATION OF LOCATING-TOTAL DOMINATION EDGE CRITICAL GRAPHS. BLIDIA, MOSTAFA; DALI, WIDAD // Discussiones Mathematicae: Graph Theory;2011, Vol. 31 Issue 1, p197 

    No abstract available.

  • Improvement on the Decay of Crossing Numbers. Černý, Jakub; Kynčl, Jan; Tóth, Géza // Graphs & Combinatorics;May2013, Vol. 29 Issue 3, p365 

    We prove that the crossing number of a graph decays in a 'continuous fashion' in the following sense. For any ε > 0 there is a δ > 0 such that for a sufficiently large n, every graph G with n vertices and m ≥ n edges, has a subgraph G′ of at most (1 − δ) m edges and...

  • SUMS OF POWERED CHARACTERISTIC ROOTS COUNT DISTANCE-INDEPENDENT CIRCULAR SETS. SKUPIEŃ, ZDZISŁAW // Discussiones Mathematicae: Graph Theory;2013, Vol. 33 Issue 1, p217 

    Significant values of a combinatorial count need not fit the recurrence for the count. Consequently, initial values of the count can much outnumber those for the recurrence. So is the case of the count, Gl(n), of distance-l independent sets on the cycle Cn, studied by Comtet for l ≥ 0 and...

  • GENERALIZED TOTAL COLORINGS OF GRAPHS. BOROWIECKI, MIECZYSŁAW; KEMNITZ, ARNFRIED; MARANGIO, MASSIMILIANO; MIHÓK, PETER // Discussiones Mathematicae: Graph Theory;2011, Vol. 31 Issue 2, p209 

    No abstract available.

  • GENERALIZED CIRCULAR COLOURING OF GRAPHS. MIHÓK, PETER; ORAVCOVÁ, JANKA; SOTÁK, ROMAN // Discussiones Mathematicae: Graph Theory;2011, Vol. 31 Issue 2, p345 

    No abstract available.

  • On the Independent Domination Number of Regular Graphs. Goddard, Wayne; Henning, Michael; Lyle, Jeremy; Southey, Justin // Annals of Combinatorics;Dec2012, Vol. 16 Issue 4, p719 

    A set S of vertices in a graph G is an independent dominating set of G if S is an independent set and every vertex not in S is adjacent to a vertex in S. In this paper, we consider questions about independent domination in regular graphs.

  • ON THE CROSSING NUMBERS OF Gâ–¡Cn FOR GRAPHS G ON SIX VERTICES. DRAŽENSKÁ, EMILIA; KLEŠČ, MARIÁN // Discussiones Mathematicae: Graph Theory;2011, Vol. 31 Issue 2, p239 

    No abstract available.

  • THE CROSSING NUMBERS OF JOIN PRODUCTS OF PATHS WITH GRAPHS OF ORDER FOUR. KLEŠČ, MARIÁN; SCHRÖTTER, ŠTEFAN // Discussiones Mathematicae: Graph Theory;2011, Vol. 31 Issue 2, p321 

    No abstract available.

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics