output
20042026
most citedDeep Learning for Visual Tracking: A Comprehensive Survey

424 citations

Showing 2016 · math.COShow all

7 papers · 2 filters

math.CO2016

Total domination polynomial of graphs from primary subgraphs

Saeid Alikhani, Nasrin Jafari

Let be a simple graph of order . The total dominating set is a subset of that every vertex of is adjacent to some vertices of . The total domination…

math.CO2016★ 2 cited

Distinguishing number and distinguishing index of neighbourhood corona of two graphs

Saeid Alikhani, Samaneh Soltani

The distinguishing number (index) () of a graph is the least integer such that has an vertex labeling (edge labeling) with labels that is preserved on…

math.CO2016★ 1 cited

Domination polynomial of clique cover product of graphs

Somayeh Jahari, Saeid Alikhani

Let be a simple graph of order . The domination polynomial of is the polynomial , where is the number of dominating sets of …

math.CO2016★ 1 cited

On the roots of total domination polynomial of graphs

Saeid Alikhani, Nasrin Jafari

Let be a simple graph of order . The total dominating set of is a subset of that every vertex of is adjacent to some vertices of . The total domi…

math.CO2016

Distinguishing number and distinguishing index of natural and fractional powers of graphs

Saeid Alikhani, Samaneh Soltani

The distinguishing number (index) () of a graph is the least integer such that has an vertex labeling (edge labeling) with labels that is preserved on…

math.CO2016★ 1 cited

Distinguishing number and distinguishing index of join of two graphs

Saeid Alikhani, Samaneh Soltani

The distinguishing number (index) () of a graph is the least integer such that has an vertex labeling (edge labeling) with labels that is preserved on…