The following pages link to Saeid Alikhani (Q277497):
Displaying 50 items.
- Independent sets of some graphs associated to commutative rings (Q5122462) (← links)
- The distinguishing chromatic number of bipartite graphs of girth at least six (Q5122711) (← links)
- Domination polynomial of clique cover product of graphs (Q5130686) (← links)
- On the zero forcing number of generalized Sierpinski graphs (Q5135721) (← links)
- More on the sixth coefficient of the matching polynomial in regular graphs (Q5151764) (← links)
- The distinguishing number and the distinguishing index of line and graphoidal graph(s) (Q5154552) (← links)
- The chromatic distinguishing index of certain graphs (Q5154569) (← links)
- On the spectral determinations of the connected multicone graphs (Q5154572) (← links)
- (Q5176264) (← links)
- Hosoya polynomial of some cactus chains (Q5193395) (← links)
- (Q5249347) (← links)
- On the domination polynomials of friendship graphs (Q5279281) (← links)
- (Q5376377) (← links)
- On k-Total Dominating Graphs (Q5377032) (← links)
- (Q5407408) (← links)
- On some parameters related to matching of graph powers (Q5865708) (← links)
- Sombor index of certain graphs (Q5877614) (← links)
- (Q5886294) (← links)
- A Roman domination chain (Q5964976) (← links)
- Hardness results of global Roman domination in graphs (Q6069177) (← links)
- Counting independent dominating sets in linear polymers (Q6101413) (← links)
- On the number of fair dominating sets of graphs (Q6101415) (← links)
- A linear-time algorithm for semitotal domination in strongly chordal graphs (Q6110593) (← links)
- Algorithmic results on locating-total domination in graphs (Q6157416) (← links)
- On the edge chromatic vertex stability number of graphs (Q6166229) (← links)
- (Q6166316) (← links)
- (Q6181633) (← links)
- Common domination perfect graphs (Q6184333) (← links)
- Domination polynomial of generalized friendship and generalized book graphs (Q6258392) (← links)
- The distinguishing number and the distinguishing index of co-normal product of two graphs (Q6289244) (← links)
- Distinguishing threshold for some graph operations (Q6376504) (← links)
- The number of distinguishing colorings of a Cartesian product graph (Q6504592) (← links)
- Co-even Domination Number of a Modified Graph by Operations on a Vertex or an Edge (Q6504790) (← links)
- Pebbling number of polymers (Q6517635) (← links)
- A New Algorithm for Computing the Frobenius Number (Q6521476) (← links)
- More on graph pebbling number (Q6521961) (← links)
- Strong coalitions in graphs (Q6531036) (← links)
- Domination polynomial and total domination polynomial of zero-divisor graphs of commutative rings (Q6531443) (← links)
- Elliptic Sombor energy of a graph (Q6532495) (← links)
- Metaheuristic algorithms for solving Roman \(\{2\}\)-domination problem (Q6550850) (← links)
- The number of distinguishing colorings of a Cartesian product graph (Q6558479) (← links)
- The Sierpiński domination number (Q6617234) (← links)
- Strong Domination number of Hajós sum and vertex-sum of two graphs (Q6620644) (← links)
- Total coalitions in graphs (Q6648822) (← links)
- On the number of isolate dominating sets of certain graphs (Q6650894) (← links)
- On the semitotal dominating sets of graphs (Q6670470) (← links)
- Counting the Number of Domatic Partition of a Graph (Q6734463) (← links)
- $k$-Coalitions in Graphs (Q6736325) (← links)
- Golden ratio in graph theory: A survey (Q6737515) (← links)
- On the number of connected edge cover sets in a graph (Q6759081) (← links)
