Zobrazeno 1 - 10
of 66
pro vyhledávání: '"K. A., Germina"'
Publikováno v:
Communications in Combinatorics & Optimization; 2024, Vol. 9 Issue 3, p555-565, 11p
Publikováno v:
The Journal of Mathematical Sociology. 47:244-254
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::da67ea7c22f825ae6e368cb28cb53469
https://doi.org/10.1080/0022250x.2021.2004596
https://doi.org/10.1080/0022250x.2021.2004596
Publikováno v:
Palestine Journal of Mathematics; 2023, Vol. 12 Issue 3, p211-215, 5p
Publikováno v:
Linear Algebra and its Applications. 608:236-247
Signed graphs have their edges labeled either as positive or negative. Here we introduce two types of signed distance matrix for signed graphs. We characterize balance in signed graphs using these matrices and we obtain explicit formulae for the dist
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::da4c7a1664c7b608a5266ff6e82cb01e
https://doi.org/10.1016/j.laa.2020.08.024
https://doi.org/10.1016/j.laa.2020.08.024
Publikováno v:
Asian-European Journal of Mathematics. 16
A signed graph [Formula: see text] is an ordered pair [Formula: see text] where [Formula: see text] is the underlying graph of [Formula: see text] with a signature function [Formula: see text]. Notions of signed distance and distance-compatible signe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::631ae4910919926a0e08ce5c064df7eb
https://doi.org/10.1142/s1793557123500158
https://doi.org/10.1142/s1793557123500158
Publikováno v:
National Academy Science Letters. 44:343-346
A connected, simple graph G with vertex set $$V(G)=\{1,2,\ldots ,n\}$$ is said to be vertex (n, k)-choosable, if there exists a collection of subsets $$\left\{ S_k(v)\subseteq V(G): v\in V\right\} $$ of cardinality k, such that $$S_k(u)\cap S_k(v)=\e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fee739fc6c78131036c983e250c8af10
https://doi.org/10.1007/s40009-020-01006-x
https://doi.org/10.1007/s40009-020-01006-x
Autor:
P. Soorya, K. A. Germina
Publikováno v:
Discrete Mathematics, Algorithms and Applications. 14
Let [Formula: see text] be a simple, connected graph of order [Formula: see text] and size [Formula: see text] Then, [Formula: see text] is said to be edge [Formula: see text]-choosable, if there exists a collection of subsets of the edge set, [Formu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fb33cc3e9d0524110b0350c5691ca436
https://doi.org/10.1142/s1793830922500252
https://doi.org/10.1142/s1793830922500252
Publikováno v:
Acta Universitatis Sapientiae: Mathematica, Vol 11, Iss 1, Pp 186-202 (2019)
An integer additive set-indexer is defined as an injective function $f:V(G)\rightarrow 2^{\mathbb{N}_0}$ such that the induced function $g_f:E(G) \rightarrow 2^{\mathbb{N}_0}$ defined by $g_f (uv) = f(u)+ f(v)$ is also injective. An IASI $f$ is said
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::78694d944224523875cf0994eedf4ffd
https://doaj.org/article/7e07e5de27744837be5974badf027f49
https://doaj.org/article/7e07e5de27744837be5974badf027f49
Publikováno v:
Malaya Journal of Matematik. 7:113-117
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::edf3636e18782d3db406b8fda12fe88e
https://doi.org/10.26637/mjm0701/0022
https://doi.org/10.26637/mjm0701/0022
Publikováno v:
Discrete Mathematics, Algorithms and Applications. 13
Sampathkumar [F. Harary, Graph Theory (Addison-Wesley, Reading, MA, 1969)] defined the coloring of a digraph [Formula: see text] as a coloring of its vertices by the following rule: Let [Formula: see text] be an arc in [Formula: see text]. If the tai
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c6636101b778e1bf05285bc0eaac1b68
https://doi.org/10.1142/s1793830921500713
https://doi.org/10.1142/s1793830921500713