On the vertex connectivity of a relation in an association scheme.
Evdokimov, S.A., Ponomarenko, I.N. (2004)
Zapiski Nauchnykh Seminarov POMI
Similarity:
Displaying similar documents to “A Generalized Vertex Truncation Scheme to Construct Intriguing Polyhedral Shapes”
On the vertex connectivity of a relation in an association scheme.
Neighbourhood tournaments
Bohdan Zelinka (1986)
Mathematica Slovaca
Similarity:
Algorithms for Triangulating Polyhedra Into a Small Number of Tethraedra
Milica Stojanović (2005)
Matematički Vesnik
Similarity:
Domatic number and degrees of vertices of a graph
Bohdan Zelinka (1983)
Mathematica Slovaca
Similarity:
Total vertex irregularity strength of disjoint union of Helm graphs
Ali Ahmad, E.T. Baskoro, M. Imran (2012)
Discussiones Mathematicae Graph Theory
Similarity:
A total vertex irregular k-labeling φ of a graph G is a labeling of the vertices and edges of G with labels from the set {1,2,...,k} in such a way that for any two different vertices x and y their weights wt(x) and wt(y) are distinct. Here, the weight of a vertex x in G is the sum of the label of x and the labels of all edges incident with the vertex x. The minimum k for which the graph G has a vertex irregular total k-labeling is called the total vertex irregularity strength of G. We...
Minimal size of a graph with diameter 2 and given maximal degree. II.
Znám, Š. (1992)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Nonexistence of a weakly neighbourly polyhedral map of type .
Nilakantan, Nandini (2003)
Experimental Mathematics
Similarity:
The isogonal sponges on the cubic lattice.
Gillispie, Steven B., Grünbaum, Branko (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity: