The following pages link to N. S. Sridharan (Q1183371):
Displayed 19 items.
- Knowledge representation for mathematical discovery: Three experiments in graph theory (Q1183372) (← links)
- Computer generation of vertex graphs (Q1222018) (← links)
- (Q1865154) (redirect page) (← links)
- Bounds on the distance two-domination number of a graph (Q1865157) (← links)
- Reinforcement number of a graph with respect to half-domination (Q2035727) (← links)
- Total reinforcement number of a graph (Q2474669) (← links)
- Total bondage number of a graph (Q2474670) (← links)
- Very excellent graphs and rigid very excellent graphs (Q2474672) (← links)
- (Q3413808) (← links)
- Discrete Fuzzy Matroids (Q3439030) (← links)
- Characterization of Graphs G for which (Q3439088) (← links)
- A Study on Hamiltonian Matroids (Q3439090) (← links)
- Characterization of Total Very Excellent Trees (Q3449426) (← links)
- (Q3489419) (← links)
- (Q3615818) (← links)
- (Q3874952) (← links)
- (Q4519736) (← links)
- Every γ-excellent, γ-flexible graph is γ<i><sub>bi</sub></i>-excellent (Q4821806) (← links)
- (Q5492619) (← links)