Zobrazeno 1 - 10
of 39
pro vyhledávání: '"T P Sandhya"'
Autor:
Jayasree, D., Kumari, T. D. Sandhya, Kishor, P. B. Kavi, Lakshmi, M. Vijaya, Narasu, M. Lakshmi
Extra cellular alkaline protease producing species is an isolate from soil which was characterized and identified as Streptomyces pulvereceus MTCC 8374. Studies on submerged fermentation revealed that maximum level of enzyme production was during ear
Externí odkaz:
http://arxiv.org/abs/1002.0048
Autor:
M. A. Shalu, T. P. Sandhya
Publikováno v:
Synergies in Analysis, Discrete Mathematics, Soft Computing and Modelling ISBN: 9789811970139
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3e1874d4667d769b422ba11ce1058273
https://doi.org/10.1007/978-981-19-7014-6_11
https://doi.org/10.1007/978-981-19-7014-6_11
Publikováno v:
International Journal of Foundations of Computer Science. 32:209-233
The goal of an outdegree-constrained edge-modification problem is to find a spanning subgraph or supergraph [Formula: see text] of an input undirected graph [Formula: see text] such that either: (Type I) the number of edges in [Formula: see text] is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::acc075b5c845ea5d228ebbba7905be5a
https://doi.org/10.1142/s012905412150012x
https://doi.org/10.1142/s012905412150012x
Publikováno v:
Discrete Applied Mathematics. 280:171-185
A partition of the vertex set of a graph G into k independent sets V 1 , V 2 , … , V k is called a k -class domination coloring ( k -cd-coloring) of G if for every V i , 1 ≤ i ≤ k , there exists a vertex x i such that V i ⊆ N [ x i ] . For a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1d4f8ddcdbf21c58b3812e9ff1ac361b
https://doi.org/10.1016/j.dam.2018.03.004
https://doi.org/10.1016/j.dam.2018.03.004
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030687656
Graph Drawing
Graph Drawing
We study the planar orthogonal drawing style within the framework of partial representation extension. Let \((G,H,\varGamma _H)\) be a partial orthogonal drawing, i.e., G is a graph, \(H\subseteq G\) is a subgraph and \(\varGamma _H\) is a planar ort
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e489e621bdc3042ca9553f4f06280246
https://doi.org/10.1007/978-3-030-68766-3_21
https://doi.org/10.1007/978-3-030-68766-3_21
Publikováno v:
Journal of Combinatorial Optimization. 35:1312-1329
A partition of the vertex set V(G) of a graph G into $$V(G)=V_1\cup V_2\cup \cdots \cup V_k$$V(G)=V1źV2źźźVk is called a k-strong subcoloring if $$d(x,y)\ne 2$$d(x,y)ź2 in G for every $$x,y\in V_i$$x,yźVi, $$1\le i \le k$$1≤i≤k where d(x, y
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e5ab4d0c71d25847bc4a018de98895bb
https://doi.org/10.1007/s10878-018-0272-z
https://doi.org/10.1007/s10878-018-0272-z
Publikováno v:
Frontiers in Algorithmics ISBN: 9783030181253
FAW
FAW
The goal of an outdegree-constrained edge-modification problem is to find a spanning subgraph or supergraph H of an input undirected graph G such that either: (Type I) the number of edges in H is minimized or maximized and H can be oriented to satisf
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ed33a445a6c1bc97389ad72e3f13b748
https://doi.org/10.1007/978-3-030-18126-0_4
https://doi.org/10.1007/978-3-030-18126-0_4
Autor:
T. P. Sandhya, M. A. Shalu
Publikováno v:
Graphs and Combinatorics. 32:2121-2134
For two disjoint vertex subsets X, Y of a graph G, we denote $$X \leftarrow Y$$XźY if every vertex of Y has at most one non-neighbour in X. A k-clique star partition of a graph G is $$V(G)=Q_1\cup Q_2\cup \ldots \cup Q_k$$V(G)=Q1źQ2źźźQk such th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::42dfa318e1684fe60a1cad6b3d99e2fd
https://doi.org/10.1007/s00373-016-1702-2
https://doi.org/10.1007/s00373-016-1702-2
Autor:
T. P. Sandhya, M. A. Shalu
Publikováno v:
Algorithms and Discrete Applied Mathematics ISBN: 9783319292205
CALDAM
CALDAM
A vertex set partition of a graph G into k independent sets $$V_1, V_2, \ldots , V_k$$ is called a k-color domination partition k-cd-coloring of G if there exists a vertex $$u_i\in VG$$ such that $$u_i$$ dominates $$V_i$$ in G for $$1 \le i \le k$$.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6cd06962fdddacbde083aaab967150bf
https://doi.org/10.1007/978-3-319-29221-2_29
https://doi.org/10.1007/978-3-319-29221-2_29
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.