Loading...
  1. Simple search
  2. Search result
Search for: g-design
0.004 seconds
Total 2 records

      Graph homomorphisms and nodal domains [electronic resource]

      , Article Linear Algebra and its Applications ; 2006, Volume 418, Issue 1, Pages 44–52 Daneshgar, A. (Amir) ; Sharif University of Technology
      Abstract
      In this paper, we derive some necessary spectral conditions for the existence of graph homomorphisms in which we also consider some parameters related to the corresponding eigenspaces such as nodal domains. In this approach, we consider the combinatorial Laplacian and co-Laplacian as well as the adjacency matrix. Also, we present some applications in graph decompositions where we prove a general version of Fisher’s inequality for G-designs  

      Graph homomorphisms and nodal domains

      , Article Linear Algebra and Its Applications ; Volume 418, Issue 1 , 2006 , Pages 44-52 ; 00243795 (ISSN) Daneshgar, A ; Hajiabolhassan, H ; Sharif University of Technology
      2006
      Abstract
      In this paper, we derive some necessary spectral conditions for the existence of graph homomorphisms in which we also consider some parameters related to the corresponding eigenspaces such as nodal domains. In this approach, we consider the combinatorial Laplacian and co-Laplacian as well as the adjacency matrix. Also, we present some applications in graph decompositions where we prove a general version of Fisher's inequality for G-designs. © 2006 Elsevier Inc. All rights reserved  
    Total 2 records