✦ LIBER ✦

The energy change of weighted graphs

✍ Scribed by Ivan Gutman; Jia-Yu Shao

Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 192 KB
Volume: 435
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2011.02.045

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The bases of weighted graphs

✍ J. Alpin; R. Mubarakzianow 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 507 KB

There are many different mathematical objects (transitive reductions, minimal equivalent digraphs, minimal connected graphs, Hasse diagrams and so on) that are defined on graphs. Although they have different names they correspond to the same object if a weighted graph is defined more generally. The

Path covers of weighted graphs

✍ Genghua Fan 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 318 KB

Let (G, w ) denote a simple graph G with a weight function w : €(G) -{0,1,2}. A path cover of (G, w ) is a collection of paths in G such that every edge e is contained in exactly w(e) paths of the collection. For a vertex u , w ( v ) is the sum of the weights of the edges incident with U ; U is call

Circular colorings of weighted graphs

✍ Deuber, Walter A.; Zhu, Xuding 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 776 KB

Suppose that G is a finite simple graph and w is a weight function which assigns to each vertex of G a nonnegative real number. Let C be a circle of length t . A t-circular coloring of (G,w) is a mapping A of the vertices of G to arcs of C such that A(%) n A(y) = 0 if (x, y) E E ( G ) and A(x) has l

Graph energy change due to edge deletion

✍ Jane Day; Wasin So 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 119 KB

Antimagic labelling of vertex weighted g

Antimagic labelling of vertex weighted graphs

✍ Tsai-Lien Wong; Xuding Zhu 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 151 KB

## Abstract Suppose __G__ is a graph, __k__ is a non‐negative integer. We say __G__ is __k__‐antimagic if there is an injection __f__: __E__→{1, 2, …, |__E__| + __k__} such that for any two distinct vertices __u__ and __v__, . We say __G__ is weighted‐__k__‐antimagic if for any vertex weight functi

Circular colorings of edge-weighted grap

Circular colorings of edge-weighted graphs

✍ Bojan Mohar 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 99 KB

## Abstract The notion of (circular) colorings of edge‐weighted graphs is introduced. This notion generalizes the notion of (circular) colorings of graphs, the channel assignment problem, and several other optimization problems. For instance, its restriction to colorings of weighted complete graphs