On the oriented incidence energy and decomposable graphs
Author(s) -
Dragan Stevanović,
Abreu de,
Maria Aguieiras A. de Freitas,
Cybele T. M. Vinagre,
Renata R. Del-Vecchio
Publication year - 2009
Publication title -
filomat
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.449
H-Index - 34
eISSN - 2406-0933
pISSN - 0354-5180
DOI - 10.2298/fil0903243s
Subject(s) - mathematics , incidence matrix , combinatorics , vertex (graph theory) , incidence (geometry) , graph , simple graph , discrete mathematics , geometry , structural engineering , node (physics) , engineering
Let G be a simple graph with n vertices and m edges. Let edges of G be given an arbitrary orientation, and let Q be the vertex-edge incidence matrix of such oriented graph. The oriented incidence energy of G is then the sum of singular values of Q. We show that for any n 2 N, there exists a set of n graphs with O(n) vertices having equal oriented incidence energy.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom