On the components of NEPS of connected bipartite graphs
نویسنده
چکیده
Back in 1983, D. Cvetković posed the conjecture that the components of NEPS of connected bipartite graphs are almost cospectral. In 2000, we showed that this conjecture does not hold for infinitely many bases of NEPS, and we posed a necessary condition on the base of NEPS for NEPS to have almost cospectral components. At the same time, D. Cvetković posed weaker version of his original conjecture which claims that each eigenvalue of NEPS is also the eigenvalue of each component of NEPS. Here we prove this weaker conjecture, give an upper bound on the multiplicity of an eigenvalue of NEPS as an eigenvalue of its component, give new sufficient condition for the almost cospectrality of components of NEPS of connected bipartite graphs, and characterize the bases of NEPS which satisfy this condition.
منابع مشابه
On Tensor Product of Graphs, Girth and Triangles
The purpose of this paper is to obtain a necessary and sufficient condition for the tensor product of two or more graphs to be connected, bipartite or eulerian. Also, we present a characterization of the duplicate graph $G 1 K_2$ to be unicyclic. Finally, the girth and the formula for computing the number of triangles in the tensor product of graphs are worked out.
متن کاملThe p-median and p-center Problems on Bipartite Graphs
Let $G$ be a bipartite graph. In this paper we consider the two kind of location problems namely $p$-center and $p$-median problems on bipartite graphs. The $p$-center and $p$-median problems asks to find a subset of vertices of cardinality $p$, so that respectively the maximum and sum of the distances from this set to all other vertices in $G$ is minimized. For each case we present some proper...
متن کاملOn Bipartite Divisor Graph for Character Degrees
The concept of the bipartite divisor graph for integer subsets has been considered in [M. A. Iranmanesh and C. E. Praeger, Bipartite divisor graphs for integer subsets, Graphs Combin., 26 (2010) 95–105.]. In this paper, we will consider this graph for the set of character degrees of a finite group G and obtain some properties of this graph. We show that if G is a solvable group, then the number...
متن کاملMETA-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
متن کاملBalanced Degree-Magic Labelings of Complete Bipartite Graphs under Binary Operations
A graph is called supermagic if there is a labeling of edges where the edges are labeled with consecutive distinct positive integers such that the sum of the labels of all edges incident with any vertex is constant. A graph G is called degree-magic if there is a labeling of the edges by integers 1, 2, ..., |E(G)| such that the sum of the labels of the edges incident with any vertex v is equal t...
متن کامل