Efficient Domination in Cayley Graphs of Generalized Dihedral Groups

E-resources

PDF

Full text

Peer reviewed Open access

Efficient Domination in Cayley Graphs of Generalized Dihedral Groups

Caliskan, Cafer; Miklavič, Štefko; Özkan, Sibel; Šparl, Primož

Discussiones Mathematicae. Graph Theory, 08/2022, Volume: 42, Issue: 3

Journal Article

An independent subset of the vertex set of the graph Γ is an for Γ if each vertex ∈ has precisely one neighbour in . In this article, we classify the connected cubic Cayley graphs on generalized dihedral groups which admit an efficient dominating set.

Keep searching

Author

Caliskan, Cafer | Miklavič, Štefko | Özkan, Sibel | Šparl, Primož

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
Year	JCR	SNIP	JCR	SNIP	JCR	SNIP	JCR	SNIP

Links to authors' personal bibliographies	Links to information on researchers in the SICRIS system

Source: Personal bibliographies and: SICRIS

Upload image

Shelf entry

Adding material to shelf was successful.

Adding material to shelf failed.

It was not necessary to add the material to the shelf.

Permalink

E-mail

Impact factor

Select the library membership card:

DRS, in which the journal is indexed

Citations

Theme