Zobrazeno 1 - 10
of 15
pro vyhledávání: '"Malay K. Sen"'
Publikováno v:
Discrete Mathematics. 339:1028-1051
An interval matrix is the adjacency matrix of an interval digraph or equivalently the biadjacency matrix of an interval bigraph. In this paper we investigate the forbidden substructures of an interval bigraph. Our method finds hitherto existing forbi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::371865a1b3d92bfca677ff18ffd1ba24
https://doi.org/10.1016/j.disc.2015.10.010
https://doi.org/10.1016/j.disc.2015.10.010
Publikováno v:
Advances in Intelligent Systems and Computing ISBN: 9783030228675
Interval graphs were used in the study of genomics by the famous molecular biologist Benzer. Later on probe interval graphs were introduced by Zhang as a generalization of interval graphs for the study of cosmid contig mapping of DNA. A tagged probe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::25fbd1d4c644c5ae7b54e4812513f416
https://doi.org/10.1007/978-3-030-22868-2_5
https://doi.org/10.1007/978-3-030-22868-2_5
Publikováno v:
Discrete Applied Mathematics. 175:71-78
A bipartite graph with partite sets X and Y is a permutation bigraph if there are two linear orderings of its vertices such that xy is an edge for x@?X and y@?Y if and only if x appears later than y in the first ordering and earlier than y in the sec
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5ce897324e65631839d0511b09350238
https://doi.org/10.1016/j.dam.2014.05.020
https://doi.org/10.1016/j.dam.2014.05.020
Publikováno v:
Journal of Graph Theory. 73:361-376
In this article, we obtain two new characterizations of circular-arc bigraphs. One of them is the representation of a circular-arc bigraph in terms of two two-clique circular-arc graphs while another one represents the same as a union of an interval
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1277275447e301611af34f0a007cc0c9
https://doi.org/10.1002/jgt.21681
https://doi.org/10.1002/jgt.21681
Publikováno v:
Discrete Applied Mathematics. 158:2004-2013
In this paper we obtain several characterizations of the adjacency matrix of a probe interval graph. In course of this study we describe an easy method of obtaining interval representation of an interval bigraph from its adjacency matrix. Finally, we
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9cf82241f9ad1cbc00d8809b89beab54
https://doi.org/10.1016/j.dam.2010.08.018
https://doi.org/10.1016/j.dam.2010.08.018
Publikováno v:
Discrete Mathematics. 306:1601-1609
An interval digraph is the intersection digraph of a family of ordered pairs of intervals on the real line; the family is an interval representation of the digraph. It is well known that an interval digraph has many representations that differ in the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c47be961add67b1c38ec8ec12da05ae8
https://doi.org/10.1016/j.disc.2005.11.032
https://doi.org/10.1016/j.disc.2005.11.032
Autor:
Malay K. Sen, Ashok Kr. Das
Publikováno v:
Discrete Mathematics. 295:191-195
Three mutually separable edges of a graph form an asteroidal triple of edges (ATE), if for any two of them, there is a path from the vertex set of one to the vertex set of another that avoids the neighbours of the third edge. In this note, it is show
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7aeff4c2d57abe95a6384cdfc697dcf2
https://doi.org/10.1016/j.disc.2004.11.012
https://doi.org/10.1016/j.disc.2004.11.012
Autor:
Barun K. Sanyal, Malay K. Sen
Publikováno v:
Journal of Graph Theory. 22:297-303
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e22e09f0cc77e3791c38503209725868
https://doi.org/10.1002/(sici)1097-0118(199608)22:4<297::aid-jgt3>3.0.co
https://doi.org/10.1002/(sici)1097-0118(199608)22:4<297::aid-jgt3>3.0.co
Autor:
Malay K. Sen, Ashok Kr. Das
Publikováno v:
Electronic Notes in Discrete Mathematics. 15:68-70
Three independent vertices in a graph form an asteroidal triple (AT) if for any two of them, there is a path that avoids the neighbours of the third vertex. The motivation to work on this topic came from the study of interval graphs. A graph is an in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bdc790dbc614ab91ee0668b55a816d4c
https://doi.org/10.1016/s1571-0653(04)00534-7
https://doi.org/10.1016/s1571-0653(04)00534-7
Autor:
Malay K. Sen, Sandip Das
Publikováno v:
Discrete Mathematics. 122(1-3):113-136
The intersection digraph of a family of ordered pairs of sets {( S v , T v ): v ∈ V } is the digraph D ( V , E ) such that uv ∈ E if and only if S u ∩ T v ≠0. Internal digraphs are those intersection digraphs for which the subsets are interva
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b33afd59304b0e855c72966e96d25dfc