✦ LIBER ✦

Reduction and expansion of live and safe marked graphs

✍ Scribed by Murata, T.; Koh, J.

Book ID: 117914168
Publisher: IEEE
Year: 1980
Weight: 423 KB
Volume: 27
Category: Article
ISSN: 0098-4094
DOI: 10.1109/tcs.1980.1084711

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Additional methods for reduction and exp

Additional methods for reduction and expansion of marked graphs

✍ Johnsonbaugh, R.; Murata, T. 📂 Article 📅 1981 🏛 IEEE ⚖ 718 KB

Scheduling of extended marked graphs

✍ Kenji Onaga 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 816 KB

Circuit theoretic analysis and synthesis

Circuit theoretic analysis and synthesis of marked graphs

✍ Murata, T. 📂 Article 📅 1977 🏛 IEEE ⚖ 739 KB

A characterization of consistent marked

A characterization of consistent marked graphs

✍ Cornelis Hoede 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 364 KB

## Abstract A marked graph is obtained from a graph by giving each point either a positive or a negative sign. Beineke and Harary raised the problem of characterzing consistent marked graphs in which the product of the signs of the points is positive for every cycle. In this paper a characterizatio

Eigenvalues and expansion of regular gra

Eigenvalues and expansion of regular graphs

✍ Kahale, Nabil 📂 Article 📅 1995 🏛 Association for Computing Machinery 🌐 English ⚖ 955 KB

Eigenvalues and expansion of bipartite g

Eigenvalues and expansion of bipartite graphs

✍ Tom Høholdt, Heeralal Janwa 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 200 KB