miun.sePublications

CiteExport$(function(){PrimeFaces.cw("TieredMenu","widget_formSmash_upper_j_idt160",{id:"formSmash:upper:j_idt160",widgetVar:"widget_formSmash_upper_j_idt160",autoDisplay:true,overlay:true,my:"left top",at:"left bottom",trigger:"formSmash:upper:exportLink",triggerEvent:"click"});}); $(function(){PrimeFaces.cw("OverlayPanel","widget_formSmash_upper_j_idt161_j_idt163",{id:"formSmash:upper:j_idt161:j_idt163",widgetVar:"widget_formSmash_upper_j_idt161_j_idt163",target:"formSmash:upper:j_idt161:permLink",showEffect:"blind",hideEffect:"fade",my:"right top",at:"right bottom",showCloseIcon:true});});

Maximal energy bipartite graphsPrimeFaces.cw("AccordionPanel","widget_formSmash_some",{id:"formSmash:some",widgetVar:"widget_formSmash_some",multiple:true}); PrimeFaces.cw("AccordionPanel","widget_formSmash_all",{id:"formSmash:all",widgetVar:"widget_formSmash_all",multiple:true});
function selectAll()
{
var panelSome = $(PrimeFaces.escapeClientId("formSmash:some"));
var panelAll = $(PrimeFaces.escapeClientId("formSmash:all"));
panelAll.toggle();
toggleList(panelSome.get(0).childNodes, panelAll);
toggleList(panelAll.get(0).childNodes, panelAll);
}
/*Toggling the list of authorPanel nodes according to the toggling of the closeable second panel */
function toggleList(childList, panel)
{
var panelWasOpen = (panel.get(0).style.display == 'none');
// console.log('panel was open ' + panelWasOpen);
for (var c = 0; c < childList.length; c++) {
if (childList[c].classList.contains('authorPanel')) {
clickNode(panelWasOpen, childList[c]);
}
}
}
/*nodes have styleClass ui-corner-top if they are expanded and ui-corner-all if they are collapsed */
function clickNode(collapse, child)
{
if (collapse && child.classList.contains('ui-corner-top')) {
// console.log('collapse');
child.click();
}
if (!collapse && child.classList.contains('ui-corner-all')) {
// console.log('expand');
child.click();
}
}
2003 (English)In: Graphs and Combinatorics, ISSN 0911-0119, E-ISSN 1435-5914, Vol. 19, no 1, p. 131-135Article in journal (Refereed) Published
##### Abstract [en]

##### Place, publisher, year, edition, pages

2003. Vol. 19, no 1, p. 131-135
##### National Category

Mathematics
##### Identifiers

URN: urn:nbn:se:miun:diva-13646DOI: 10.1007/s00373-002-0487-7ISI: 000182689700009Scopus ID: 2-s2.0-0038238082OAI: oai:DiVA.org:miun-13646DiVA, id: diva2:411881
#####

PrimeFaces.cw("AccordionPanel","widget_formSmash_j_idt476",{id:"formSmash:j_idt476",widgetVar:"widget_formSmash_j_idt476",multiple:true});
#####

PrimeFaces.cw("AccordionPanel","widget_formSmash_j_idt483",{id:"formSmash:j_idt483",widgetVar:"widget_formSmash_j_idt483",multiple:true});
#####

PrimeFaces.cw("AccordionPanel","widget_formSmash_j_idt489",{id:"formSmash:j_idt489",widgetVar:"widget_formSmash_j_idt489",multiple:true}); Available from: 2011-04-19 Created: 2011-04-19 Last updated: 2017-12-11Bibliographically approved

Given a graph G, its energy E(G) is defined to be the sum of the absolute values of the eigenvalues of G. This quantity is used in chemistry to approximate the total pi-electron energy of molecules and in particular, in case G is bipartite, alternant hydrocarbons. Here we show that if G is a bipartite graph with n vertices, thenE(G) less than or equal to n/(root8 (root2 + n)must hold, characterize those bipartite graphs for which this bound is sharp, and provide an infinite family of maximal energy bipartite graphs.Given a graph G, define the energy of G, denoted E(G), by[GRAPHICS]where the eigenvalues of, G are simply those of the adjacency matrix of G. In chemistry, the energy of a graph is intensively studied since it can be used to approximate, the total pi-electron energy of a molecule (see, for example, [3, 6, 8]). In [12], we considered maximal energy graphs (see also [9, 10, 13, 14, 17] for related results). In particular, for any graph G with n vertices, we derived an improvement of the well-known McClelland bound [15] for the energy of a graph, showing thatE(G) less than or equal to n/2(1 + rootn)must hold. We also characterized those graphs for which this bound is sharp, i.e. the maximal energy graphs, and provided an infinite family of such graphs.

doi
urn-nbn$(function(){PrimeFaces.cw("Tooltip","widget_formSmash_j_idt1339",{id:"formSmash:j_idt1339",widgetVar:"widget_formSmash_j_idt1339",showEffect:"fade",hideEffect:"fade",showDelay:500,hideDelay:300,target:"formSmash:altmetricDiv"});});

CiteExport$(function(){PrimeFaces.cw("TieredMenu","widget_formSmash_lower_j_idt1392",{id:"formSmash:lower:j_idt1392",widgetVar:"widget_formSmash_lower_j_idt1392",autoDisplay:true,overlay:true,my:"left top",at:"left bottom",trigger:"formSmash:lower:exportLink",triggerEvent:"click"});}); $(function(){PrimeFaces.cw("OverlayPanel","widget_formSmash_lower_j_idt1393_j_idt1395",{id:"formSmash:lower:j_idt1393:j_idt1395",widgetVar:"widget_formSmash_lower_j_idt1393_j_idt1395",target:"formSmash:lower:j_idt1393:permLink",showEffect:"blind",hideEffect:"fade",my:"right top",at:"right bottom",showCloseIcon:true});});