Zobrazeno 1 - 10
of 463
pro vyhledávání: '"C. Laskar"'
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 17, Iss 3, Pp 1028-1038 (2020)
In this paper we introduce two concepts related to resolvability and the metric dimension of graphs. The kth dimension of a graph G is the maximum cardinality of a subset of vertices of G that is resolved by a set S of order k. Some first results are
Externí odkaz:
https://doaj.org/article/84bd270fd36248e29c3e875c5fd19759
Publikováno v:
Communications in Combinatorics and Optimization, Vol 5, Iss 1, Pp 69-81 (2020)
Let x and y be two distinct vertices in a connected graph G. The x, ylocation of a vertex w is the ordered pair of distances from w to x and y, that is, the ordered pair (d(x, w), d(y, w)). A set of vertices W in G is x, y-located if any two vertic
Externí odkaz:
https://doaj.org/article/103220c5d51f4a50a9948262f71629bf
Publikováno v:
Communications in Combinatorics and Optimization, Vol 4, Iss 2, Pp 151-171 (2019)
A set of vertices $S$ in a connected graph $G$ is a different-distance set if, for any vertex $w$ outside $S$, no two vertices in $S$ have the same distance to $w$. The lower and upper different-distance number of a graph are the order of a smallest
Externí odkaz:
https://doaj.org/article/7f744179ede74385a340d96ee15cf757
Publikováno v:
Atmospheric Environment. 193:109-117
Modern anthropogenic aerosols usually exhibit low but significant Δ33S signatures (−0.6 to 0.5‰) whose origin still remains unclear. While isotope fractionation factors associated with the oxidation of SO2 by O2+TMI (Transition Metal Ion), H2O2
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ba1ca720b34d391ae015b305a7127c30
https://doi.org/10.1016/j.atmosenv.2018.09.007
https://doi.org/10.1016/j.atmosenv.2018.09.007
Publikováno v:
Graphs and Combinatorics. 34:193-205
Let $$G=(V,E)$$G=(V,E) be an isolate-free graph. For some $$\alpha $$ź with $$0
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bad99602bbbc16fe60f91946710e7d5d
https://doi.org/10.1007/s00373-017-1869-1
https://doi.org/10.1007/s00373-017-1869-1
Autor:
Renu C. Laskar, Henry Martyn Mulder
Publikováno v:
Discussiones Mathematicae. Graph Theory, 33(4), 731-745. University of Zielona Gora
Discussiones Mathematicae Graph Theory, Vol 33, Iss 4, Pp 731-745 (2013)
Discussiones Mathematicae Graph Theory, Vol 33, Iss 4, Pp 731-745 (2013)
A path-neighborhood graph is a connected graph in which every neighborhood induces a path. In the main results the 3-sun-free path-neighborhood graphs are characterized. The 3-sun is obtained from a 6-cycle by adding three chords between the three pa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::12b955da6bb5dfe2dd73407ecb5838fd
https://doi.org/10.7151/dmgt.1700
https://doi.org/10.7151/dmgt.1700
Publikováno v:
Fuel Processing Technology. 92:2360-2365
Short Path Distillates of vacuum residue (boiling above 545 °C) is taken as feedstock for this study. Wax from this fraction is separated by solvent extraction method using methyl iso-butyl ketone (MIBK) as solvent. Both wax and the feedstock are ch
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d84a89135890a9862b66ca94a710b450
https://doi.org/10.1016/j.fuproc.2011.07.001
https://doi.org/10.1016/j.fuproc.2011.07.001
Publikováno v:
Journal of Polymer Research. 18:225-233
The free radical copolymerization of di-n-docosyl fumarate with vinyl acetate and n-alkyl (meth)acrylates was carried out in toluene at 70°C using benzoyl peroxide as an initiator. 1H NMR and carbon analysis was used to determine the copolymer compo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::69815342895c0272832321bde4812535
https://doi.org/10.1007/s10965-010-9410-8
https://doi.org/10.1007/s10965-010-9410-8
Autor:
Jeremy Lyle, Renu C. Laskar
Publikováno v:
Discrete Applied Mathematics. 157(2):330-338
The question of whether a graph can be partitioned into k independent dominating sets, which is the same as having a fall k-colouring, is considered. For k=3, it is shown that a graph G can be partitioned into three independent dominating sets if and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1a94790278ecd51f125a8be46eb2c076
Autor:
Thasneem T. R.1 thasneem@maharajas.ac.in, Menon, Manju K.2 manjumenonk@gmail.com
Publikováno v:
Proyecciones - Journal of Mathematics. Oct2024, Vol. 43 Issue 5, p1037-1053. 17p.