Results 61 to 68 of about 468 (68)

On Two Generalized Connectivities of Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2018
The concept of generalized k-connectivity κk(G), mentioned by Hager in 1985, is a natural generalization of the path-version of the classical connectivity.
Sun Yuefang, Li Fengwei, Jin Zemin
doaj   +1 more source

Equistarable graphs and counterexamples to three conjectures on equistable graphs

open access: yes, 2014
Equistable graphs are graphs admitting positive weights on vertices such that a subset of vertices is a maximal stable set if and only if it is of total weight $1$.
Milanič, Martin, Trotignon, Nicolas
core  

Computing the Metric Dimension of a Graph from Primary Subgraphs

open access: yesDiscussiones Mathematicae Graph Theory, 2017
Let G be a connected graph. Given an ordered set W = {w1, . . . , wk} ⊆ V (G) and a vertex u ∈ V (G), the representation of u with respect to W is the ordered k-tuple (d(u, w1), d(u, w2), . . .
Kuziak Dorota   +2 more
doaj   +1 more source

The Planar Index and Outerplanar Index of Some Graphs Associated to Commutative Rings

open access: yesDiscussiones Mathematicae - General Algebra and Applications, 2019
In this paper, we study the planar and outerplanar indices of some graphs associated to a commutative ring. We give a full characterization of these graphs with respect to their planar and outerplanar indices when R is a finite ring.
Barati Zahra, Afkhami Mojgan
doaj   +1 more source

The Subset-Strong Product of Graphs

open access: yesAnnales Mathematicae Silesianae
In this paper, we introduce the subset-strong product of graphs and give a method for calculating the adjacency spectrum of this product. In addition, exact expressions for the first and second Zagreb indices of the subset-strong products of two graphs ...
Eliasi Mehdi
doaj   +1 more source

On the distinguishing chromatic number of the Kronecker products of graphs

open access: yesAKCE International Journal of Graphs and Combinatorics
In this paper, we investigate the distinguishing chromatic number of Kronecker product of paths, cycles, star graphs, symmetric trees, almost symmetric trees, and bisymmetric trees.
Zinat Rastgar   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy