✦ LIBER ✦

The weighted complexity and the determinant functions of graphs

✍ Scribed by Dongseok Kim; Young Soo Kwon; Jaeun Lee

Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 147 KB
Volume: 433
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2010.03.001

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

The computation of the distance matrix a

The computation of the distance matrix and the Wiener index for graphs of arbitrary complexity with weighted vertices and edges

✍ Peter Senn 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 952 KB

On the complexity of analysis and manipu

On the complexity of analysis and manipulation of Boolean functions in terms of decision graphs

✍ Jordan Gergov; Christoph Meinel 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 590 KB

The energy change of weighted graphs

✍ Ivan Gutman; Jia-Yu Shao 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 192 KB

On the Complexity of Recognizing Hamming

On the Complexity of Recognizing Hamming Graphs and Related Classes of Graphs

✍ Wilfried Imrich; Sandi Klavzar 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 287 KB

The searchlight guarding problem on weig

The searchlight guarding problem on weighted split graphs and weighted cographs

✍ Yen, William C. K.; Tang, C. Y. 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 223 KB 👁 2 views

This paper addresses the searchlight guarding problem, which is an extension of so-called graph searching/guarding problem on a weighted, undirected graph G by considering the time-slot parameter in addition to the traditional building cost. Given a weighted, undirected graph G G G, suppose that the