- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1435-5914
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
On the Connectivity and Independence Number of Power Graphs of Groups ; volume:36 ; number:3 ; day:31 ; month:3 ; year:2020 ; pages:895-904 ; date:5.2020
Graphs and combinatorics ; 36, Heft 3 (31.3.2020), 895-904, 5.2020
- Classification
-
Mathematik
- Creator
-
Cameron, Peter J.
Jafari, Sayyed Heidar
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s00373-020-02162-z
- URN
-
urn:nbn:de:101:1-2020070322385717013920
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:59 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Cameron, Peter J.
- Jafari, Sayyed Heidar
- SpringerLink (Online service)
Other Objects (12)
On the signed 2-independence number of graphs
Some news about the independence number of a graph
On Selkow's bound on the independence number of graphs
On the signed (total) k-independence number in graphs
Counterexamples to the Characterisation of Graphs with Equal Independence and Annihilation Number
A lower bound on the independence number of a graph in terms of degrees
Graph Scanning and Connectivity
On Pairwise Graph Connectivity
Independence and k-independence in graphs in terms of degrees
Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number
On cycles and independence in graphs
On independence and $k$-independence in graphs with given degree sequence
On the signed 2-independence number of graphs
Some news about the independence number of a graph
On Selkow's bound on the independence number of graphs
On the signed (total) k-independence number in graphs
Counterexamples to the Characterisation of Graphs with Equal Independence and Annihilation Number
A lower bound on the independence number of a graph in terms of degrees
Graph Scanning and Connectivity
On Pairwise Graph Connectivity
Independence and k-independence in graphs in terms of degrees
Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number
On cycles and independence in graphs
On independence and $k$-independence in graphs with given degree sequence
On the signed 2-independence number of graphs
Some news about the independence number of a graph
On Selkow's bound on the independence number of graphs
On the signed (total) k-independence number in graphs
Counterexamples to the Characterisation of Graphs with Equal Independence and Annihilation Number
A lower bound on the independence number of a graph in terms of degrees
Graph Scanning and Connectivity
On Pairwise Graph Connectivity
Independence and k-independence in graphs in terms of degrees
Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number
On cycles and independence in graphs