E-resources
Peer reviewed
Open access
-
Kavi, Lord C.; Newman, Mike
Discrete mathematics, July 2023, 2023-07-00, Volume: 346, Issue: 7Journal Article
A k-independent set in a connected graph is a set of vertices such that any two vertices in the set are at distance greater than k in the graph. The k-independence number of a graph, denoted αk, is the size of a largest k-independent set in the graph. Recent results have made use of polynomials that depend on the spectrum of the graph to bound the k-independence number. They are optimized for the cases k=1,2. There are polynomials that give good (and sometimes) optimal results for general k, including case k=3. In this paper, we provide the best possible bound that can be obtained by choosing a polynomial for case k=3 and apply this bound to well-known families of graphs including the Hamming 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.