✦ LIBER ✦

On graphs with signed inverses

✍ Scribed by Fred Buckley; Lynne L. Doty; Frank Harary

Publisher: John Wiley and Sons
Year: 1988
Tongue: English
Weight: 271 KB
Volume: 18
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230180302

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Enumeration of graphs with signed points

Enumeration of graphs with signed points and lines

✍ Frank Harary; Edgar M. Palmer; Robert W. Robinson; Allen J. Schwenk 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 485 KB

## Abstract Our object is to enumerate graphs in which the points or lines or both are assigned positive or negative signs. We also treat several associated problems for which these configurations are self‐dual with respect to sign change. We find that the solutions to all of these counting problem

On the embedding of graphs into graphs w

On the embedding of graphs into graphs with few eigenvalues

✍ Vu, Van H. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 726 KB

A graph is called of type k if it is connected, regular, and has k distinct eigenvalues. For example graphs of type 2 are the complete graphs, while those of type 3 are the strongly regular graphs. We prove that for any positive integer n, every graph can be embedded in n cospectral, non-isomorphic

Inverse problem for the Sturm–Liouville

Inverse problem for the Sturm–Liouville equation on a star-shaped graph

✍ V. Pivovarchik 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 268 KB

## Abstract The problem of small vibrations of a graph consisting of __n__ smooth inhomogeneous stretched strings joined at the vertex with the pendant ends fixed is reduced to the Sturm–Liouville boundary problem on a star‐shaped graph. The obtained problem occurs also in quantum mechanics. The sp

On graphs with linear Ramsey numbers

✍ R. L. Graham; V. Rödl; A. Ruciński 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 141 KB 👁 1 views

On graphs with small Ramsey numbers

✍ A. V. Kostochka; V. Rödl 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 88 KB

## Abstract Let __R__(__G__) denote the minimum integer __N__ such that for every bicoloring of the edges of __K~N~__, at least one of the monochromatic subgraphs contains __G__ as a subgraph. We show that for every positive integer __d__ and each γ,0 < γ < 1, there exists __k__ = __k__(__d__,γ) su

On graphs with prescribed median I

✍ G. R. T. Hendry 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 202 KB 👁 1 views

The distance of a vertex u in a connected graph H is the sum of all the distances from u to the other vertices of H. The median M(H) of H is the subgraph of H induced by the vertices of minimum distance. For any graph G, let f ( G ) denote the minimum order of a connected graph H satisfying M(H) = G