Equienergetic net-regular signed graphs

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

More Equienergetic Signed Graphs

The energy of signed graph is the sum of the absolute values of the eigenvalues of its adjacency matrix. Two signed graphs are said to be equienergetic if they have same energy. In the literature the construction of equienergetic signed graphs are reported. In this paper we obtain the characteristic polynomial and energy of the join of two signed graphs and thereby we give another construction ...

متن کامل

On net-Laplacian Energy of Signed Graphs

A signed graph is a graph where the edges are assigned either positive ornegative signs. Net degree of a signed graph is the dierence between the number ofpositive and negative edges incident with a vertex. It is said to be net-regular if all itsvertices have the same net-degree. Laplacian energy of a signed graph is defined asε(L(Σ)) =|γ_1-(2m)/n|+...+|γ_n-(2m)/n| where γ_1,...,γ_n are the ei...

متن کامل

On co-regular signed graphs

A graph whose edges are labeled either as positive or negative is called a signed graph. A signed graph is said to be net-regular if every vertex has constant net-degree k, namely, the difference between the number of positive and negative edges incident with a vertex. In this paper, we analyze some properties of co-regular signed graphs which are net-regular signed graphs with the underlying g...

متن کامل

Nowhere-zero flows on signed regular graphs

We study the flow spectrum S(G) and the integer flow spectrum S(G) of odd regular graphs. We show that there are signed graphs where the difference between the integer flow number and the flow number is greater than or equal to 1, disproving a conjecture of Raspaud and Zhu [7]. Let G be a (2t + 1)-regular graph. We show that if r ∈ S(G), then r = 2 + 1t or r ≥ 2 + 2 2t−1 . This result generaliz...

متن کامل

Regular matroid decomposition via signed graphs

The key to Seymour’s Regular Matroid Decomposition Theorem is his result that each 3-connected regular matroid with no R10or R12-minor is graphic or cographic. We present a proof of this in terms of signed graphs. 2004 Wiley Periodicals, Inc. J Graph Theory 48: 74–84, 2005

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Contemporary Mathematical Sciences

سال: 2014

ISSN: 1314-7544

DOI: 10.12988/ijcms.2014.410108