Glossary of signed and gain graphs and allied areas.
Zaslavsky, Thomas (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Zaslavsky, Thomas (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Amitava Bhattacharya, Gurusamy Rengasamy Vijayakumar (2002)
Discussiones Mathematicae Graph Theory
Similarity:
Let G be a graph with Δ(G) > 1. It can be shown that the domination number of the graph obtained from G by subdividing every edge exactly once is more than that of G. So, let ξ(G) be the least number of edges such that subdividing each of these edges exactly once results in a graph whose domination number is more than that of G. The parameter ξ(G) is called the subdivision number of G. This notion has been introduced by S. Arumugam and S. Velammal. They have conjectured that for any...
J. Nieminen (1975)
Applicationes Mathematicae
Similarity:
Girse, Robert D. (1986)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Ivan Havel (1965)
Časopis pro pěstování matematiky
Similarity:
Ferdinand Gliviak, Peter Kyš, Ján Plesník (1969)
Matematický časopis
Similarity:
Exoo, Geoffrey (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Broderick Arneson, Piotr Rudnicki (2006)
Formalized Mathematics
Similarity:
We are formalizing the algorithm for recognizing chordal graphs by lexicographic breadth-first search as presented in [13, Section 3 of Chapter 4, pp. 81-84]. Then we follow with a formalization of another algorithm serving the same end but based on maximum cardinality search as presented by Tarjan and Yannakakis [25].This work is a part of the MSc work of the first author under supervision of the second author. We would like to thank one of the anonymous reviewers for very useful suggestions. ...