The following pages link to Saeid Alikhani (Q277497):
Displaying 50 items.
- On the \(k\)-edge magic graphs (Q277499) (← links)
- Signed mixed Roman domination numbers in graphs (Q328725) (← links)
- (Q352149) (redirect page) (← links)
- An admissible estimator for the \(r\)th power of a bounded scale parameter in a subclass of the exponential family under entropy loss function (Q352150) (← links)
- On the domination polynomial of some graph operations (Q361577) (← links)
- The domination polynomial of a graph at \(-1\) (Q367055) (← links)
- Algebraic integers as chromatic and domination roots (Q446327) (← links)
- Graphs whose certain polynomials have few distinct roots (Q470526) (← links)
- Domination polynomials of \(k\)-tree related graphs (Q471790) (← links)
- Independence roots and independence fractals of certain graphs (Q545570) (← links)
- Randić energy of specific graphs (Q668724) (← links)
- Characterization of graphs using domination polynomials (Q709243) (← links)
- Relation between the skew-rank of an oriented graph and the independence number of its underlying graph (Q724735) (← links)
- On \(k\)-edge-magic labelings of maximal outerplanar graphs (Q896094) (← links)
- Dominating sets and domination polynomials of paths (Q1028883) (← links)
- Rational exponents in extremal graph theory (Q1644492) (← links)
- The distinguishing number and distinguishing index of the lexicographic product of two graphs (Q1649920) (← links)
- The distinguishing number of Kronecker product of two graphs (Q1683578) (← links)
- Independence number and \(k\)-trees of graphs (Q1684925) (← links)
- On the barycentric labeling of certain graphs (Q2018963) (← links)
- Maximum independent sets near the upper bound (Q2026337) (← links)
- The number of 2-dominating sets, and 2-domination polynomial of a graph (Q2030139) (← links)
- Mostar index and edge Mostar index of polymers (Q2052298) (← links)
- Reconfiguring dominating sets in minor-closed graph classes (Q2053687) (← links)
- Reconfiguration graphs for dominating sets (Q2073197) (← links)
- The co-secure domination in proper interval graphs (Q2078841) (← links)
- Restrained Roman and restrained Italian domatic numbers of graphs (Q2081477) (← links)
- Upper total domination in claw-free cubic graphs (Q2084795) (← links)
- Minimum 2-dominating sets in regular graphs (Q2091810) (← links)
- Bounds on domination parameters in graphs: a brief survey (Q2151205) (← links)
- Nonseparating independent sets and maximum genus of graphs (Q2155662) (← links)
- Trees with distinguishing index equal distinguishing number plus one (Q2175243) (← links)
- Trees with distinguishing number two (Q2176156) (← links)
- On the independent domination polynomial of a graph (Q2217495) (← links)
- Total dominator chromatic number of some operations on a graph (Q2221506) (← links)
- Construction of dominating sets of certain graphs (Q2249929) (← links)
- On the structure of dominating graphs (Q2409507) (← links)
- On the unimodality of domination polynomials (Q2673493) (← links)
- Independent bondage number of planar graphs with minimum degree at least 3 (Q2675833) (← links)
- More on energy and Randic energy of specific graphs (Q2834006) (← links)
- (Q2837164) (← links)
- (Q2860813) (← links)
- (Q2876786) (← links)
- On the graphs with four distinct domination roots (Q2885503) (← links)
- (Q2905996) (← links)
- (Q2911314) (← links)
- (Q2932584) (← links)
- (Q2933520) (← links)
- (Q2954283) (← links)
- DISTINGUISHING NUMBER AND DISTINGUISHING INDEX OF JOIN OF TWO SPECIFIC GRAPHS (Q2968230) (← links)
