نتایج جستجو برای: equienergetic graphs
تعداد نتایج: 97282 فیلتر نتایج به سال:
Let $S(G^{sigma})$ be the skew-adjacency matrix of the oriented graph $G^{sigma}$, which is obtained from a simple undirected graph $G$ by assigning an orientation $sigma$ to each of its edges. The skew energy of an oriented graph $G^{sigma}$ is defined as the sum of absolute values of all eigenvalues of $S(G^{sigma})$. Two oriented graphs are said to be skew equienergetic iftheir skew energies...
In this paper, we obtain some upper and lower bounds for the general extended energy of a graph. As an application, we obtain few bounds for the (edge) Zagreb energy of a graph. Also, we deduce a relation between Zagreb energy and edge-Zagreb energy of a graph $G$ with minimum degree $delta ge2$. A lower and upper bound for the spectral radius of the edge-Zagreb matrix is obtained. Finally, we ...
two digraphs of same order are said to be skew-equienergetic if theirskew energies are equal. one of the open problems proposed by li andlian was to construct non-cospectral skew-equienergetic digraphs onn vertices. recently this problem was solved by ramane et al. inthis paper, we give some new methods to construct new skew-equienergeticdigraphs.
The energy, E(G), of a simple graph G is defined to be the sum of the absolute values of the eigen values of G. If G is a k-regular graph on n vertices,then E(G) k+√k(n− 1)(n− k)= B2 and this bound is sharp. It is shown that for each > 0, there exist infinitely many n for each of which there exists a k-regular graph G of order n with k < n− 1 and B2 < . Two graphs with the same number of vertic...
A graph G is said to be orderenergetic, if its energy equal order and it hypoenergetic less than order. Two non-isomorphic graphs of same are equienergetic their energies equal. In this paper, we construct some new families orderenergetic graphs, equiorderenergetic equihypoenergetic graphs.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید