The sum of degrees in cliques.
Bollobás, Béla, Nikiforov, Vladimir (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Bollobás, Béla, Nikiforov, Vladimir (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Xu, Xiaodong, Luo, Haipeng, Shao, Zehui (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
H.P. Patil, R. Pandiya Raj (2013)
Discussiones Mathematicae Graph Theory
Similarity:
The technique of counting cliques in networks is a natural problem. In this paper, we develop certain results on counting of triangles for the total graph of the Mycielski graph or central graph of star as well as completegraph families. Moreover, we discuss the upper bounds for the number of triangles in the Mycielski and other well known transformations of graphs. Finally, it is shown that the achromatic number and edge-covering number of the transformations mentioned above are equated. ...
Allen, Peter (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Gary Chartrand, Ronald J. Gould, S. F. Kapoor (1980)
Mathematica Slovaca
Similarity:
Al-Addasi, Salah, Al-Ezeh, Hasan (2008)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Filip Guldan (1987)
Časopis pro pěstování matematiky
Similarity:
Lutz Volkmann (2013)
Discussiones Mathematicae Graph Theory
Similarity:
Let G be a finite and simple graph with vertex set V (G), and let f V (G) → {−1, 1} be a two-valued function. If ∑x∈N|v| f(x) ≤ 1 for each v ∈ V (G), where N[v] is the closed neighborhood of v, then f is a signed 2-independence function on G. The weight of a signed 2-independence function f is w(f) =∑v∈V (G) f(v). The maximum of weights w(f), taken over all signed 2-independence functions f on G, is the signed 2-independence number α2s(G) of G. In this work, we mainly present upper bounds...