The following pages link to Renu C. Laskar (Q686247):
Displaying 50 items.
- (Q599059) (redirect page) (← links)
- Finite nets of dimension d (Q599060) (← links)
- Holes in \(L(2,1)\)-coloring on certain classes of graphs (Q624160) (← links)
- Irredundancy in circular arc graphs (Q686248) (← links)
- On domination and independent domination numbers of a graph (Q754234) (← links)
- Gallai theorems for graphs, hypergraphs, and set systems (Q804601) (← links)
- Introduction to ``Topics on Domination'' (Q804605) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- Fall colouring of bipartite graphs and Cartesian products of graphs (Q1003677) (← links)
- On powers and centers of chordal graphs (Q1055453) (← links)
- A note on total domination (Q1065020) (← links)
- A linear algorithm for finding a minimum dominating set in a cactus (Q1078205) (← links)
- Path number and bipartite digraphs (Q1144040) (← links)
- Finite nets of dimension three. I (Q1211518) (← links)
- Some coloring numbers for complete r-partite graphs (Q1216319) (← links)
- Cubic graphs on twelve vertices and the line graph of a finite affine plane (Q1217814) (← links)
- On decomposition of r-partite graphs into edge-disjoint Hamilton circuits (Q1223314) (← links)
- Partial geometry of dimension three (Q1245223) (← links)
- On complementary graphs with no isolated vertices (Q1252360) (← links)
- Chessboard graphs, related designs, and domination parameters (Q1298906) (← links)
- Restrained domination in graphs (Q1301655) (← links)
- On the edge-integrity of some graphs and their complements (Q1313866) (← links)
- Periodic gossiping on trees (Q1339893) (← links)
- The bondage and reinforcement numbers of \(\gamma_ f\) for some graphs (Q1356465) (← links)
- On the equality of the partial Grundy and upper ochromatic numbers of graphs (Q1415544) (← links)
- On \(\alpha \)-domination in graphs (Q1706432) (← links)
- Generalized subgraph-restricted matchings in graphs (Q1779490) (← links)
- Nearly perfect sets in graphs (Q1842165) (← links)
- Factor domination and minimum degree (Q1868841) (← links)
- \(\alpha\)-domination (Q1969776) (← links)
- Quorum colorings of graphs (Q2443417) (← links)
- Simultaneous graph parameters: factor domination and factor total domination (Q2509300) (← links)
- Eigenvalues of the adjacency matrix of cubic lattice graphs (Q2533744) (← links)
- Eigenvalues of the adjacency matrix of tetrahedral graphs (Q2539012) (← links)
- An algorithm for partial Grundy number on trees (Q2576842) (← links)
- (Q2713615) (← links)
- (Q2760993) (← links)
- (Q2760998) (← links)
- (Q2799827) (← links)
- Cycle Domination, Independence and Irredundance in graphs (Q2799842) (← links)
- Minimal rankings of the Cartesian product K_{n}□ K_{m} (Q2866417) (← links)
- Split Domination, Independence, and Irredundance in Graphs (Q2971222) (← links)
- (Q2971229) (← links)
- Edge Cut Domination, Irredundance, and Independence in Graphs (Q2971262) (← links)
- (Q3012398) (← links)
- (Q3033783) (← links)
- (Q3035321) (← links)
- (Q3088453) (← links)
- (Q3089176) (← links)
- (Q3113172) (← links)
