In modern SoCs, embedded memories occupy the largest part of the chip area and include
an even larger amount of active devices. As memories are designed very tightly to the limits …

A coprime labeling of a graph of order $ n $ is an assignment of distinct positive integer
labels in which adjacent vertices have relatively prime labels. Restricting labels to only the …

The vertex cover problem is a classical graph optimization problem which remains
intractable even for cubic graphs and planar graphs with maximum degree at most three. In …

We consider the weakly convex and convex domination numbers for two classes of graphs:
generalized Petersen graphs and flower snark graphs. For a given generalized Petersen …

A set S of vertices of a graph G=(V, E) is called a vertex cover, if each edge in E has at least
one end point in S and the minimum cardinality taken over all vertex covering sets of G is …

For the law enforcement agencies, lawful interception is still one of the main means to
intercept a suspect or address most illegal actions. Due to its centralized management …

V této práci analyzujeme reálné chodníkové sítě z pohledu grafové teorie. Začínáme
získáním dat chodníkových sítí z OpenStreetMap a jejich serializací do různých datových …

It is known that any vertex cover of the generalized Petersen graph P (n, k) has size at least
n. Behsaz, Hatami and Mahmoodian characterized such graphs with minimum vertex cover …

A set S of vertices of a graph G=(V, E) is called a vertex cover, if each edge in E has at least
one end point in S and the minimum cardinality taken over all vertex covering sets of G is …

Determining the size of a maximum independent set of a graph $ G $, denoted by $\alpha
(G) $, is an NP-hard problem. Therefore, many attempts are made to find upper and lower …