Under Graph

Under Graph

Under Graph (アンダーグラフ) es una banda de rock&pop japonés, con varios años de trayectoria indie y una ascendente carrera major. Con un estilo de rock bien ligero y con un gran uso de guitarras suavemente distorsionadas con delays. La banda sabe combinar estilos variados como el beat pop y el soft rock. En Japón se le compara con bandas como Mr.Children y Bump of Chicken

Contenido

Integrantes

  • Matohara Naoto (Vocalista/Guitarras)
  • Asa Ryosuke (Guitarra)
  • Nakahara Kazumasa (Bajo y Coros)
  • Naoko Taniguchi (Batería)

Biografía

Under Graph comenzó como banda el año 1997. Comenzaron a sonar en conciertos en vivo de la ciudad de Kobe, generalmente en pubs y eventos menores; más tarde en el 2000 se trasladan a Tokyo para profesionalizar su carrera musical. En marzo de 2002 comienzan a lanzar sus discos indies, Sin embargo su lanzamiento como majors vendría en el año 2004, gracias a la difusión de la banda en la radio Nack5. En ese mismo año lanzaron hana-bira su primer single como major y desde ahí en adelante no han parado de lanzar singles y álbumes de gran calidad musical

Discografía

Indie Singles

  1. hana-bira
  2. Keserasera
  3. 'Majime Sugiru Kimi He'

Major Singles

  1. Tsubasa
  2. Kimi no Koe
  3. Paradigm
  4. Majime Sugiru Kimi He
  5. Yubisaki Kara Sekai o
  6. Mata Kaeru Kara

Álbums

  1. Zero he no Chouwa
  2. Subarashiki Nichijou

Enlaces externos


Wikimedia foundation. 2010.

Игры ⚽ Нужен реферат?

Mira otros diccionarios:

  • Under graph — is a Japanese band. It was formed in 1997.Member profiles*Vocals/Guitar: Naoto Matohara(真戸原 直人, Matohara Naoto) Birthdate:July27,1997 Blud Tipe:B Equipment: Gibson ES 325 Fender customshop 69storatocaster　BLACK SHINOS LUCK6V amp… …   Wikipedia

  • graph — n *chart, map Analogous words: plot, scheme, design, *plan: diagram, outline, sketch (see under SKETCH vb) graph vb chart, map (see under CHART n) Analogous words: see those at GRAPH n …   New Dictionary of Synonyms

  • Graph property — In graph theory a graph property is any inherently graph theoretical property of graphs (formal definitions follow), distinguished from properties of graphs described in terms of various graph representations: graph drawings, data structures for… …   Wikipedia

  • Graph coloring — A proper vertex coloring of the Petersen graph with 3 colors, the minimum number possible. In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called colors to elements of a graph… …   Wikipedia

  • Graph automorphism — In graph theoretical mathematics, an automorphism of a graph is a form of symmetry in which the graph is mapped onto itself while preserving the edge vertex connectivity.Formally, an automorphism of a graph G = ( V , E ) is a permutation sigma;… …   Wikipedia

  • Graph labeling — In the mathematical discipline of graph theory, a graph labeling is the assignment of labels traditionally represented with integers to the edges or vertices, or both, of a graph. The labeling strategy depends on the category of the labeling.… …   Wikipedia

  • Graph embedding — In topological graph theory, an embedding of a graph G on a surface Sigma; is a representation of G on Sigma; in which points of Sigma; are associated to vertices and simple arcs (homeomorphic images of [0,1] ) are associated to edges in such a… …   Wikipedia

  • -graph — comb. form forming nouns and verbs meaning: 1 a thing written or drawn etc. in a specified way (autograph; photograph). 2 an instrument that records (heliograph; seismograph; telegraph). * * * ˌgraf, aa(ə)f, aif, ȧf noun combining form ( s)… …   Useful english dictionary

  • Graph cuts in computer vision — As applied in the field of computer vision, graph cuts can be employed to efficiently solve a wide variety of low level computer vision problems ( early vision ), such as image smoothing, the stereo correspondence problem, and many other computer …   Wikipedia

  • Cactus graph — A cactus graph (sometimes called a cactus tree) is a connected graph in which any two simple cycles have at most one vertex in common. Equivalently, every edge in such a graph may belong to at most one cycle.Cactus graphs were first studied under …   Wikipedia

Compartir el artículo y extractos

Link directo
… Do a right-click on the link above
and select “Copy Link”