Results 141 to 150 of about 5,516,987 (160)

Strict Neighbor-Distinguishing Total Index of Graphs

Acta Mathematica Sinica, English Series, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gu, Jing, Wang, Wei Fan, Wang, Yi Qiao
exaly   +3 more sources

2-Distance vertex-distinguishing index of subcubic graphs

Journal of Combinatorial Optimization, 2018
Weifan Wang, , Wang Weifan
exaly   +2 more sources

On the Neighbour-Distinguishing Index of a Graph

Graphs and Combinatorics, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Keith Edwards, Mirko Hornák, Mariusz Wozniak   +2 more
openaire   +2 more sources

The optimal general upper bound for the distinguishing index of infinite graphs

Journal of Graph Theory, 2019
The distinguishing index D′(G) of a graph G is the least cardinal number d such that G has an edge‐coloring with d colors, which is preserved only by the trivial automorphism.
M. Pilsniak, Marcin Stawiski
semanticscholar   +1 more source

The distinguishing number and the distinguishing index of graphs from primary subgraphs

2019
Summary: The distinguishing number (index) \(D(G)\) \((D'(G))\) of a graph \(G\) is the least integer \(d\) such that \(G\) has an vertex labeling (edge labeling) with \(d\) labels that is preserved only by a trivial automorphism. Let \(G\) be a connected graph constructed from pairwise disjoint connected graphs \(G_1,\dots,G_k\) by selecting a vertex ...
Alikhani, Saeid, Soltani, Samaneh
openaire   +1 more source

An upper bound on the distinguishing index of graphs with minimum degree at least two

, 2017
The distinguishing index of a simple graph $G$, denoted by $D'(G)$, is the least number of labels in an edge labeling of $G$ not preserved by any non-trivial automorphism.
S. Alikhani, S. Soltani
semanticscholar   +1 more source

Neighbor Sum Distinguishing Index of Sparse Graphs

Acta Mathematica Sinica. English series, 2020
Ji Hui Wang, Baojian Qiu, Jiansheng Cai
semanticscholar   +1 more source

Two-Distance Vertex-Distinguishing Index of Sparse Subcubic Graphs

Bulletin of the Malaysian Mathematical Sciences Society, 2019
Loumngam Kamga Victor, Juan Liu, Weifan Wang   +2 more
semanticscholar   +1 more source

Strict neighbor-distinguishing index of K4-minor-free graphs

Discrete Applied Mathematics, 2023
Weifan Wang, Yiqiao Wang
exaly  

The optimal general upper bound for the distinguishing index of infinite graphs

Journal of Graph Theory, 2020
Monika Pilśniak, Marcin Stawiski
exaly