E-resources
-
Jothi, R. Mary Jeya; Elavathingaln, Ebin Ephrem
2015 Online International Conference on Green Engineering and Technologies (IC-GET), 11/2015Conference Proceeding
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. Super strongly perfect graph's structure includes even cycles (which is 2 - regular). In this line of thought, a discussion on the regularity of complete k-partite graph is given using super strongly perfect graph.
Shelf entry
Permalink
- URL:
Impact factor
Access to the JCR database is permitted only to users from Slovenia. Your current IP address is not on the list of IP addresses with access permission, and authentication with the relevant AAI accout is required.
Year | Impact factor | Edition | Category | Classification | ||||
---|---|---|---|---|---|---|---|---|
JCR | SNIP | JCR | SNIP | JCR | SNIP | JCR | SNIP |
Select the library membership card:
If the library membership card is not in the list,
add a new one.
DRS, in which the journal is indexed
Database name | Field | Year |
---|
Links to authors' personal bibliographies | Links to information on researchers in the SICRIS system |
---|
Source: Personal bibliographies
and: SICRIS
The material is available in full text. If you wish to order the material anyway, click the Continue button.