• No results found

On the stable degree of graphs

N/A
N/A
Protected

Academic year: 2019

Share "On the stable degree of graphs"

Copied!
13
0
0

Loading.... (view fulltext now)

Full text

Figure

Fig. 1. AA = {1, 2, 6, 7} is an asteroidal set of this graph with interior I(A) = {3, 4, 5}
Fig. 2. An example illustrating Lemma 6.

References

Related documents

Even if the special types of bicycles tested in this project have not helped the participants overcome all of the deterrents, they still can be said to have facilitated the shift

The following question guided this research: What are the issues related to the use of teacher-developed MCQ examinations as the only method of student assessment and evaluation

Therefore, the purpose of this study was to isolate and quantify surviving faecal indicator bacteria from the human GI tract in blackwater obtained from a pilot source

It also shows that there is a need to assemble further (and more accurate) data regarding the actual cost premium of green or sustainably designed buildings, as well as data

Any death benefit of the policy will not be payable if you or anyone covered by additional riders commits suicide, while sane or insane, within two years from the policy or

Namely, the brain activation of each participant (depending on its role, communicated contents, and other factors) manifests in particular interconnections of the affected brain

In this paper, we give fragmentability bounds for some classes of graphs of bounded average degree, as well as classes of given thickness, the class of k-colourable graphs, and

How SAF Resources Are Defined to Use External Security (see page 19) Control Table Access Using SQL Resources or OPSGLOBAL (see page 22) Commands and Functions that