GRAPH.bib

@COMMENT{{This file has been generated by bib2bib 1.46}}

@COMMENT{{Command line: bib2bib -ob GRAPH.bib -c " ropsections:'GRAPH' " bigBiblioFile.bib}}

@COMMENT{{ bigBiblioFile.bib generated by makebib.sh version }}

@COMMENT{{ concatenation of journals_ref.bib withpyblio.bib optimization.bib mypapers.bib other.bib refvulg.bib these_ref.bib philo.bib ../math/journals_ref.bib ../math/citeseer.bib ../math/books.bib }}

@COMMENT{{ date: Thu Nov 2 00:20:16 CET 2006 }}


@ARTICLE{0305-4470-35-15-303,
  AUTHOR = {Christophe Texier},
  TITLE = {Scattering theory on graphs: II. The Friedel sum
                  rule},
  JOURNAL = {Journal of Physics A: Mathematical and General},
  VOLUME = {35},
  NUMBER = {15},
  PAGES = {3389-3407},
  YEAR = {2002},
  ROPSECTIONS = {MULTISCATT PHYSX GRAPH LOCALIZATION},
  PDF = {/sci_docs/physics/papers/JPhysA/texier2002scattering.pdf},
  ABSTRACT = {We consider the Friedel sum rule (FSR) in the
                  context of the scattering theory for the
                  Schr\"{o}dinger operator -D$_{ x }$$^{2}$ + V ( x )
                  on graphs made of one-dimensional wires connected to
                  external leads. We generalize the Smith formula for
                  graphs. We give several examples of graphs where the
                  state counting method given by the FSR does not
                  work. The reason for the failure of the FSR to count
                  the states is the existence of states localized in
                  the graph and not coupled to the leads, which occurs
                  if the spectrum is degenerate and the number of
                  leads too small. }
}

@COMMENT{{ThisfilehasbeengeneratedbyPybliographer}}


@ARTICLE{fan2002subgraph,
  AUTHOR = {G. Fan},
  TITLE = {Subgraph Coverings and Edge Switchings},
  JOURNAL = {Journal of Combinatorial Theory},
  YEAR = {2002},
  VOLUME = {84},
  NUMBER = {1},
  PAGES = {54-83},
  MONTH = {January},
  NOTE = {Series B},
  ROPSECTIONS = {GRAPH},
  PDF = {/mathpapers/JCombTh/fan2002subgraph.pdf},
  ABSTRACT = {By using the so-defined circuit/path transformations
  together with an edge-switching method, the following conjectures
  are proved in this paper. (i) The
     edges of a connected graph on n vertices can be covered by at
     most paths, which was conjectured by Chung. (ii) The edges of a
     2-connected graph on n vertices can be covered by at most
     circuits, which was conjectured by Bondy. An immediate
     consequence of (ii) is a theorem of Pyber that the edges of a
     graph on n vertices can be covered by at most n-1 edges and
     circuits, which was conjectured by Erdös, Goodman, and Pósa. }
}