We study edge-sum distinguishing labeling, a type of labeling recently introduced by Z. Tuza (2017) in context games. An ESD an $n$-vertex graph $G$ is injective mapping integers $1$ to $l$ its vertices such that for every edge, the sum on endpoints unique. If $ l$ equals $n$, we speak about canonical labeling. focus primarily structural properties this and show several classes graphs if they h...

Graph labeling is considered as one of the most interesting areas in graph theory. A for a simple G (numbering or valuation), an association non -negative integers to vertices G  (vertex labeling) edges (edge both them. In this paper we study graceful k- uniform hypertree and define condition corresponding tree be graceful. if minimum difference vertices’ labels each edge dis...

The article discusses the creation of expression and idea historical epistemology. It problematized context rise what would be epistemology who have been pioneer author in introduction expression, traditionally considered as resulting from Dominique Lecourt’s book, L’Épistémologie historique de Gaston Bachelard (1969). possible options for affiliating are explored, pertinence attributing invent...