May 2012
Discussiones Mathematicae: Graph Theory;2012, Vol. 32 Issue 2, p373
Academic Journal
A graph is edge cycle extendable if every cycle C that is formed from edges and one chord of a larger cycle C+ is also formed from edges and one chord of a cycle C' of length one greater than C with V (C') ⊆ V (C+). Edge cycle extendable graphs are characterized by every block being either chordal (every nontriangular cycle has a chord) or chordless (no nontriangular cycle has a chord); equivalently, every chord of a cycle of length five or more has a noncrossing chord.


Related Articles

  • Quivers with potentials associated to triangulated surfaces.  // Proceedings of the London Mathematical Society;May2009, Vol. 98 Issue 3, p797 

    We attempt to relate two recent developments: cluster algebras associated to triangulations of surfaces by Fomin–Shapiro–Thurston, and quivers with potentials (QPs) and their mutations introduced by Derksen–Weyman–Zelevinsky. To each ideal triangulation of a bordered...

  • On Detour Spectra of Some Graphs. Ayyaswamy, S. K.; Balachandran, S. // World Academy of Science, Engineering & Technology;Jul2010, Issue 43, p529 

    No abstract available.

  • The critical group of K × C. Wang, Jian; Pan, Yong; Xu, Jun // Acta Mathematica Sinica;Jan2011, Vol. 27 Issue 1, p169 

    In this paper, the structure of the critical group of the graph K × C is determined, where m, n ≥ 3.

  • Invariants of the stable equivalence of symmetric special biserial algebras. Antipov, M. // Journal of Mathematical Sciences;Feb2007, Vol. 140 Issue 5, p611 

    The present paper is one in a series of papers devoted to the classification of some classes of tame algebras up to stable category equivalence. In this paper, we study symmetric algebras (their stable categories have a structure of triangulated categories) and the simplest class of tame...

  • Difference Cordial Labeling of Graphs Obtained from Triangular Snakes. Ponraj, R.; Narayanan, S. Sathish // Applications & Applied Mathematics;Dec2014, Vol. 9 Issue 2, p811 

    In this paper, we investigate the difference cordial labeling behavior of corona of triangular snake with the graphs of order one and order two and also corona of alternative triangular snake with the graphs of order one and order two.

  • A Note on Pair Sum Graphs. Ponraj, R.; Parthipan, J. V. X.; Kala, R. // Journal of Scientific Research;2011, Vol. 3 Issue 2, p321 

    Let G be a (p,q) graph. An injective map ƒ: V (G) → {±1, ±2,…,±p} is called a pair sum labeling if the induced edge function, ƒe: E(G) → Z -{0} defined by ƒe (uv)=ƒ(u)+ƒ(v) is one-one and ƒe(E(G)) is either of the form {±k1, ±k2,…,...

  • NEW BOUNDS ON THE EDGE-BANDWIDTH OF TRIANGULAR GRIDS. LAN LIN; YIXUN LIN // RAIRO -- Theoretical Informatics & Applications;2015, Vol. 49 Issue 1, p47 

    The edge-bandwidth of a graph G is the bandwidth of the line graph of G. Determining the edge-bandwidth B' (Tn) of triangular grids Tn is an open problem posed in 2006. Previously, an upper bound and an asymptotic lower bound were found to be 3n-1 and 3n-o(n) respectively. In this paper we...

  • ON SOME PROPERTIES OF KOROBOV POLYNOMIALS. PYLYPIV, V. M.; MALIARCHUK, A. R. // Carpathian Mathematical Publications;2014, Vol. 6 Issue 1, p130 

    We represent Korobov polynomials as paradeterminants of triangular matrices and prove some of their properties.

  • On Mean Graphs. Vasuki, R.; Arockiaraj, S. // International Journal of Mathematical Combinatorics;Sep2013, Vol. 3, p22 

    Let G(V,E) be a graph with p vertices and q edges. For every assignment f : V (G) → {0, 1, 2, 3, ..., q}, an induced edge labeling f* : E(G) → {1, 2, 3, ..., q} is … if f(u) and f(v) are of the same parity otherwise for every edge uv ∈ E(G). If f*(E) = {1, 2, ..., q}, then...


Read the Article


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

Try another library?
Sign out of this library

Other Topics