AI Chat AI Image Generator AI Video Text to Speech

Generalized Vertex Transitivity in Graphs

06/30/2018

∙

by Kannan Balakrishnan, et al.

∙

∙

In this paper, we introduce a generalized concept of vertex transitivity in graphs called generalized vertex transitivity. We put forward a new invariant called transitivity number of a graph. The value of this invariant in different classes of graphs is explored. Also, different results showing the importance of this concept is established.

Kannan Balakrishnan
6 publications
Divya Sindhu Lekha
3 publications

page 1

page 2

page 3

page 4

research

∙ 06/27/2019

[1,2]-Domination in Generalized Petersen Graphs

A vertex subset S of a graph G=(V,E) is a [1,2]-dominating set if each v...

0 Fairouz Beggas, et al. ∙

research

∙ 02/14/2022

Beyond symmetry in generalized Petersen graphs

A graph is a core or unretractive if all its endomorphisms are automorph...

0 Ignacio Garcia-Marco, et al. ∙

research

∙ 06/07/2022

Vertex-critical (P_3+ℓ P_1)-free and vertex-critical (gem, co-gem)-free graphs

A graph G is k-vertex-critical if χ(G)=k but χ(G-v)<k for all v∈ V(G) wh...

0 Tala Abuadas, et al. ∙

research

∙ 11/15/2017

On consistent vertex nomination schemes

Given a vertex of interest in a network G_1, the vertex nomination probl...

0 Vince Lyzinski, et al. ∙

research

∙ 06/18/2020

An Alon-Boppana theorem for powered graphs and generalized Ramanujan graphs

The r-th power of a graph modifies a graph by connecting every vertex pa...

0 Emmanuel Abbe, et al. ∙

research

∙ 06/29/2022

Generalized Permutants and Graph GENEOs

In this paper we establish a bridge between Topological Data Analysis an...

0 Faraz Ahmad, et al. ∙

research

∙ 01/22/2023

A graph isomorphism invariant based on neighborhood aggregation

This paper presents a new graph isomorphism invariant, called 𝔴-labeling...

0 Alpár Jüttner, et al. ∙