Literatura académica sobre el tema "Graphe quasi-Bipartite"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte las listas temáticas de artículos, libros, tesis, actas de conferencias y otras fuentes académicas sobre el tema "Graphe quasi-Bipartite".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Artículos de revistas sobre el tema "Graphe quasi-Bipartite"
Ma, Junye, Qingguo Li y Hui Li. "Some properties about the zero-divisor graphs of quasi-ordered sets". Journal of Algebra and Its Applications 19, n.º 04 (12 de junio de 2019): 2050074. http://dx.doi.org/10.1142/s0219498820500747.
Texto completoKumar, P. Ramana Vijaya y Dr Bhuvana Vijaya. "Applications of Hamiltonian Cycle from Quasi Spanning Tree of Faces based Bipartite Graph". Journal of Advanced Research in Dynamical and Control Systems 11, n.º 12-SPECIAL ISSUE (31 de diciembre de 2019): 505–12. http://dx.doi.org/10.5373/jardcs/v11sp12/20193245.
Texto completoAnsari-Toroghy, Habibollah, Shokoufeh Habibi y Masoomeh Hezarjaribi. "On the graph of modules over commutative rings II". Filomat 32, n.º 10 (2018): 3657–65. http://dx.doi.org/10.2298/fil1810657a.
Texto completoNaji Hameed, Zainab y Hiyam Hassan Kadhem. "On Degree Topology and Set-T_0 space". Wasit Journal of Computer and Mathematics Science 1, n.º 4 (31 de diciembre de 2022): 213–19. http://dx.doi.org/10.31185/wjcm.91.
Texto completoGröpl, Clemens, Stefan Hougardy, Till Nierhoff y Hans Jürgen Prömel. "Steiner trees in uniformly quasi-bipartite graphs". Information Processing Letters 83, n.º 4 (agosto de 2002): 195–200. http://dx.doi.org/10.1016/s0020-0190(01)00335-0.
Texto completoBagheri Gh., Behrooz, Tomas Feder, Herbert Fleischner y Carlos Subi. "On Finding Hamiltonian Cycles in Barnette Graphs". Fundamenta Informaticae 188, n.º 1 (27 de diciembre de 2022): 1–14. http://dx.doi.org/10.3233/fi-222139.
Texto completoLiu, Meng y Yusheng Li. "Ramsey numbers and bipartite Ramsey numbers via quasi-random graphs". Discrete Mathematics 344, n.º 1 (enero de 2021): 112162. http://dx.doi.org/10.1016/j.disc.2020.112162.
Texto completoBen-Ari, Iddo, Hugo Panzo, Philip Speegle y R. Oliver VandenBerg. "Quasi-Stationary Distributions for the Voter Model on Complete Bipartite Graphs". Latin American Journal of Probability and Mathematical Statistics 18, n.º 1 (2021): 421. http://dx.doi.org/10.30757/alea.v18-19.
Texto completoRowlinson, Peter. "More on graphs with just three distinct eigenvalues". Applicable Analysis and Discrete Mathematics 11, n.º 1 (2017): 74–80. http://dx.doi.org/10.2298/aadm161111033r.
Texto completoYu, Guidong, Gaixiang Cai, Miaolin Ye y Jinde Cao. "Energy Conditions for Hamiltonicity of Graphs". Discrete Dynamics in Nature and Society 2014 (2014): 1–6. http://dx.doi.org/10.1155/2014/305164.
Texto completoTesis sobre el tema "Graphe quasi-Bipartite"
Pisanu, Francesco. "On box-total dual integrality and total equimodularity". Electronic Thesis or Diss., Paris 13, 2023. http://www.theses.fr/2023PA131044.
Texto completoIn this thesis, we study box-totally dual integral (box-TDI) polyhedra associated with severalproblems and totally equimodular matrices. Moreover, we study the complexity of some funda-mental questions related to them.We start by considering totally equimodular matrices, which are matrices such that, forevery subset of linearly independent rows, all nonsingular maximal submatrices have the samedeterminant in absolute value. Despite their similarities with totally unimodular matrices, wehighlight several differences, even in the case of incidence and adjacency matrices of graphs.As is well-known, the incidence matrix of a given graph is totally unimodular if and only if thegraph is bipartite. However, the total equimodularity of an incidence matrix depends on whetherwe consider the vertex-edge or the edge-vertex representation. We provide characterizations forboth cases. As a consequence, we prove that recognizing whether a given polyhedron is box-TDIis a co-NP-complete problem.Characterizing the total unimodularity or total equimodularity of the adjacency matrix of agiven bipartite graph remains unsolved, while we solved the corresponding problem in the case oftotal equimodularity when the graph is nonbipartite.In a later part of this work, we characterize the graphs for which the perfect matching polytope(PMP) is described by trivial inequalities and the inequalities corresponding to tight cuts. Tightcuts are defined as cuts that share precisely one edge with each perfect matching. We thenprove that any graph for which the corresponding PMP is box-TDI belongs to this class. Asa consequence, it turns out that recognizing whether the PMP is box-TDI is a polynomial-timeproblem. However, we provide several counterexamples showing that this class of graphs does notguarantee the box-TDIness of the PMP.Lastly, we present necessary conditions for the box-TDIness of the edge cover polytope andcharacterize the box-TDIness of the extendable matching polytope, which is the convex hull ofthe matchings included in a perfect matching
Capítulos de libros sobre el tema "Graphe quasi-Bipartite"
"Quasi-biclique Detection from Bipartite Graphs". En Network Data Mining and Analysis, 79–112. WORLD SCIENTIFIC, 2018. http://dx.doi.org/10.1142/9789813274969_0005.
Texto completoActas de conferencias sobre el tema "Graphe quasi-Bipartite"
Zhu, Na. "Signature of Quasi-Complete Graphs and Quasi-Complete Bipartite Graphs". En 2018 14th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD). IEEE, 2018. http://dx.doi.org/10.1109/fskd.2018.8686948.
Texto completoEpishin, Vladlen I. "Studying Fault Tolerance of Bipartite Homogeneous Minimal Quasi-Complete Graphs Using Cisco Packet Tracer". En 2021 IEEE Conference of Russian Young Researchers in Electrical and Electronic Engineering (ElConRus). IEEE, 2021. http://dx.doi.org/10.1109/elconrus51938.2021.9396232.
Texto completo