Some improved bounds on two energy-like invariants of some derived graphs

نویسندگان
چکیده

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

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

منابع مشابه

Bounds for Incidence Energy of Some Graphs

LetG be a finite, simple, and undirected graphwith n vertices. Thematrix L(G) = D(G)−A(G) (resp., L+(G) = D(G)+A(G)) is called the Laplacianmatrix (resp., signless Laplacianmatrix [1–4]) of G, where A(G) is the adjacency matrix and D(G) is the diagonal matrix of the vertex degrees. (For details on Laplacian matrix, see [5, 6].) Since A(G), L(G) and L+(G) are all real symmetric matrices, their e...

متن کامل

Some Invariants of Circulant Graphs

Mobeen Munir 1, Waqas Nazeer 1, Zakia Shahzadi 1 and Shin Min Kang 2,3,* 1 Division of Science and Technology, University of Education, Lahore 54000, Pakistan; [email protected] (M.M.); [email protected] (W.N.); [email protected] (Z.S.) 2 Department of Mathematics and Research Institute of Natural Science, Gyeongsang National University, Jinju 52828, Korea 3 Center for General Educati...

متن کامل

Applications of some Graph Operations in Computing some Invariants of Chemical Graphs

In this paper, we first collect the earlier results about some graph operations and then we present applications of these results in working with chemical graphs.

متن کامل

Some Invariants of Jahangir Graphs

Mobeen Munir 1, Waqas Nazeer 1, Shin Min Kang 2,3, Muhammad Imran Qureshi 4, Abdul Rauf Nizami 1 and Youl Chel Kwun 5,* 1 Division of Science and Technology, University of Education, Lahore 54000, Pakistan; [email protected] (M.M.); [email protected] (W.N.); [email protected] (A.R.N.) 2 Department of Mathematics and Research Institute of Natural Science, Gyeongsang National University, Jin...

متن کامل

Some lower bounds for the $L$-intersection number of graphs

‎For a set of non-negative integers~$L$‎, ‎the $L$-intersection number of a graph is the smallest number~$l$ for which there is an assignment of subsets $A_v subseteq {1,dots‎, ‎l}$ to vertices $v$‎, ‎such that every two vertices $u,v$ are adjacent if and only if $|A_u cap A_v|in L$‎. ‎The bipartite $L$-intersection number is defined similarly when the conditions are considered only for the ver...

متن کامل

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


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

ژورنال

عنوان ژورنال: Open Mathematics

سال: 2019

ISSN: 2391-5455

DOI: 10.1515/math-2019-0069