The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
A graph G is said to be strongly perfect if every induced sub graph H has an independent set, meeting all maximal complete sub graphs of H. A strongly perfect graph is said to be very strongly perfect if it contains good independent set. It follows that every very strongly perfect graph is perfect not conversely. For example, the compliment of even cycle of length more than 4 is not very strongly...
A graph G(V, E) with n vertices is said to have modular multiplicative divisor (MMD) labeling if there exist a bijection f:V(G) → {1, 2,…,n} and the induced function f*:E(G) → {0, 1, 2,…,n − 1}where f*(uv) = f(u)f(v)(mod n) for all uv ∊ E(G) such that n divides the sum of all edge labels of G. The graph G is super strongly perfect (SSP) if every induced subgraph H of G contains a minimal dominating...
A graph G is super strongly perfect if every induced subgraph H of G possesses a minimal dominating set that meets all the maximal cliques of H. A regular graph is a graph where each vertex has the same number of neighbors; i.e. every vertex has the same degree. A regular graph with vertices of degree k is called a k-regular graph. Regularity of graphs plays an important role in communication networks...
A Graph G is Super Strongly Perfect Graph if every induced sub graph H of G possesses a minimal dominating set that meets all the maximal complete sub graphs of H. In this paper we have characterized the structure of super strongly perfect graphs in Prism and Rook's Networks. Along with this characterization, we have investigated the Super Strongly Perfect ness in Prism and Rook's Networks. Also we...
Network is the engineering discipline concerned with the communication between computer systems or devices. A computer network is any set of computers or devices connected to each other with the ability to exchange data. Computers on a network are sometimes called nodes. Networks can be broadly classified as using graphs. In the most common sense of the term, a graph is an ordered pair G = (V, E)...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.