The following pages link to Belmannu Devadas Acharya (Q1772202):
Displaying 50 items.
- (Q321994) (redirect page) (← links)
- On graphs whose graphoidal domination number is one (Q321997) (← links)
- (Q585214) (redirect page) (← links)
- The contraction polynomial of a graph (Q585216) (← links)
- Supra-hereditary properties of hypergraphs (Q691620) (← links)
- Characterization of a signed graph whose signed line graph is \(S\)-consistent (Q730777) (← links)
- On the graphs having unique maximal-connecting partition graphs (Q754897) (← links)
- A characterization of consistent marked graphs (Q800943) (← links)
- Some further properties of consistent marked graphs (Q800944) (← links)
- Domination in hypergraphs: corrigendum (Q950669) (← links)
- Standardization of perspectives into degree-splitting graph of a graph (Q972967) (← links)
- General systems and some related problems (Q1053036) (← links)
- Graphs whose r-neighbourhoods form conformal hypergraphs (Q1061750) (← links)
- New algebraic models of social systems (Q1075279) (← links)
- Connectedness and acyclicity of the transposed square of a graph (Q1078583) (← links)
- An extension of Katai-Iwai procedure to derive balancing and minimum balancing sets of a social system (Q1088610) (← links)
- Graphoidal covers and graphoidal covering number of a graph (Q1091403) (← links)
- Set sequential graphs (Q1109792) (← links)
- Further results on k-sequential graphs (Q1114714) (← links)
- Indominable graphs cannot be characterised by a family of forbidden subgraphs (Q1160194) (← links)
- On characterizing graphs switching equivalent to acyclic graphs (Q1160195) (← links)
- On cohesion and stress of vertices in a graph (Q1161753) (← links)
- An extension of the concept of clique graphs and the problem of K- convergence to signed graphs (Q1167191) (← links)
- Connected graphs switching equivalent to their iterated line graphs (Q1170205) (← links)
- Strongly indexable graphs (Q1182885) (← links)
- On certain vertex valuations of a graph. I (Q1184911) (← links)
- On regular graphs (Q1250113) (← links)
- On the cyclomatic number of a hypergraph (Q1257911) (← links)
- A direct inductive proof of a conjecture due to E. Sampathkumar and L. Pushpa Latha on the weak domination number of a tree (Q1273282) (← links)
- Incidence self complementary hypergraphs (Q1279398) (← links)
- A note on dominating functions of a graph (Q1289402) (← links)
- On point-set domination in graphs. IV: Separable graphs with unique minimum psd-sets (Q1296965) (← links)
- Domination in graphoidal covers of a graph (Q1304801) (← links)
- Interrelations among the notions of independence, domination and full sets in a hypergraph (Q1352832) (← links)
- On point-set domination in graphs. VI: Quest to characterise blocks containing independent PSD-sets (Q1425419) (← links)
- Parallel transformation of graphs: graphs having unique elementary parallel transformation (Q1772203) (← links)
- Hypergraphs with cyclomatic number zero, triangulated graphs, and an inequality (Q1836675) (← links)
- Locally semi-consecutive edge labelings of graphs (Q1886193) (← links)
- A unimodal sequence for hypergraphs (Q1886194) (← links)
- Implications of a matter-radius measurement for the structure of carbon-22 (Q2345002) (← links)
- On point-set domination in graphs. II: Minimum psd-sets (Q2369384) (← links)
- Domination in discrete structures -- new directions (Q2474658) (← links)
- Domination in hypergraphs (Q2474659) (← links)
- Further results on domination in graphoidally covered graphs (Q2474660) (← links)
- The minimum robust domination energy of a connected graph (Q2474661) (← links)
- Energy of a set of vertices in a graph (Q2474662) (← links)
- Intersection graph of minimal dominating sets of a graph (Q2474664) (← links)
- Partially balanced incomplete block designs arising from minimal dominating sets of a graph (Q2474674) (← links)
- Spectra and energies of iterated line graphs of regular graphs (Q2484670) (← links)
- There are exactly seven graphs whose subdivision graphs are bipartite self-complementary (Q2565131) (← links)
