The following pages link to Saeid Alikhani (Q277497):
Displaying 50 items.
- (Q2954283) (← links)
- DISTINGUISHING NUMBER AND DISTINGUISHING INDEX OF JOIN OF TWO SPECIFIC GRAPHS (Q2968230) (← links)
- (Q2975300) (← links)
- (Q3001399) (← links)
- An atlas of domination polynomials of graphs of order at most six (Q3098552) (← links)
- (Q3134356) (← links)
- Distinguishing number and distinguishing index of neighbourhood corona of two graphs (Q3299359) (← links)
- ON THE ROOTS OF TOTAL DOMINATION POLYNOMIAL OF GRAPHS, II (Q3388607) (← links)
- Dominating sets of centipedes (Q3400281) (← links)
- Dominatind sets and domination polynomials of certain graphs. II (Q3561550) (← links)
- (Q3618734) (← links)
- (Q3629107) (← links)
- Chromatic zeros and the golden ratio (Q3649769) (← links)
- Chromatic zeros and generalized Fibonacci numbers (Q3655054) (← links)
- SOME FAMILIES OF GRAPHS WHOSE DOMINATION POLYNOMIALS ARE UNIMODAL (Q4593504) (← links)
- (Q4609338) (← links)
- Distinguishing number and distinguishing index of natural and fractional powers of graphs (Q4612221) (← links)
- Anti-forcing number of some specific graphs (Q4617716) (← links)
- Symmetry breaking in planar and maximal outerplanar graphs (Q4621305) (← links)
- On the Saturation Number of Graphs (Q4621420) (← links)
- (Q4627713) (← links)
- Stabilizing the distinguishing number of a graph (Q4633988) (← links)
- (Q4921399) (← links)
- ON THE EDGE COVER POLYNOMIAL OF CERTAIN GRAPHS (Q4956347) (← links)
- TOTAL DOMINATION POLYNOMIAL OF GRAPHS FROM PRIMARY SUBGRAPHS (Q4956403) (← links)
- A GRAPH WHICH RECOGNIZES IDEMPOTENTS OF A COMMUTATIVE RING (Q4956440) (← links)
- THE COST NUMBER AND THE DETERMINING NUMBER OF A GRAPH (Q4956581) (← links)
- Distinguishing index of Kronecker product of two graphs (Q4958047) (← links)
- An upper bound on the distinguishing index of graphs with minimum degree at least two (Q4969593) (← links)
- (Q4975268) (← links)
- (Q4977207) (← links)
- THE k-INDEPENDENT GRAPH OF A GRAPH (Q4978543) (← links)
- (Q4982374) (← links)
- (Q4982520) (← links)
- Introduction to Domination Polynomial of a Graph (Q4982930) (← links)
- The distinguishing number (index) and the domination number of a graph (Q4986551) (← links)
- The distinguishing number and the distinguishing index of graphs from primary subgraphs (Q4988455) (← links)
- On the dominated chromatic number of certain graphs (Q4997222) (← links)
- Distinguishing number and distinguishing index of strong product of two graphs (Q4998754) (← links)
- Introduction to dominated edge chromatic number of a graph (Q5004071) (← links)
- Some families of graphs with no nonzero real domination roots (Q5009965) (← links)
- Computation of Gutman index of some cactus chains (Q5009974) (← links)
- Sombor Index of Polymers (Q5013021) (← links)
- Some new results on the total domination polynomial of a graph (Q5016055) (← links)
- Distinguishing number and distinguishing index of certain graphs (Q5020420) (← links)
- On the roots of total domination polynomial of graphs (Q5034559) (← links)
- Total dominator chromatic number of k-subdivision of graphs (Q5058169) (← links)
- Number of colors needed to break symmetries of a graph by an arbitrary edge coloring (Q5058213) (← links)
- More on the unimodality of domination polynomial of a graph (Q5083860) (← links)
- On the signed domination number of some Cayley graphs (Q5119286) (← links)
