Let GG be a class of graphs. A graph G is a probe graph of GG if its vertex set can be partitioned into a set P of `probes' and an independent set N of `nonprobes' such that G can be embedded into a graph of GG by adding edges between certain nonprobes. In this book we investigate probe graphs of various classes of graphs.
Comments: 121 Pages.
[v1] 2012-10-16 23:30:24
Unique-IP document downloads: 350 times
Articles available on viXra.org are pre-prints that may not yet have been verified by peer-review and should therefore be treated as preliminary and speculative. Nothing stated should be treated as sound unless confirmed and endorsed by a concensus of independent qualified experts. In particular anything that appears to include financial or legal information or proposed medical treatments should not be taken as such. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.
Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.