Bibliographies thématiques / Intersection digraphs

Sommaire

  1. Articles de revues
  2. Thèses
  3. Chapitres de livres
  4. Actes de conférences

Littérature scientifique sur le sujet « Intersection digraphs »

Auteur : Grafiati
Publié le 18 mai 2024
Mis à jour le 31 juillet 2025

Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres

Choisissez une source :

Consultez les listes thématiques d’articles de revues, de livres, de thèses, de rapports de conférences et d’autres sources académiques sur le sujet « Intersection digraphs ».

À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.

Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.

Articles de revues sur le sujet "Intersection digraphs"

1

Cary, Michael. "Vertices with the second neighborhood property in Eulerian digraphs." Opuscula Mathematica 39, no. 6 (2019): 765–72. http://dx.doi.org/10.7494/opmath.2019.39.6.765.

Texte intégral
Résumé :
The Second Neighborhood Conjecture states that every simple digraph has a vertex whose second out-neighborhood is at least as large as its first out-neighborhood, i.e. a vertex with the Second Neighborhood Property. A cycle intersection graph of an even graph is a new graph whose vertices are the cycles in a cycle decomposition of the original graph and whose edges represent vertex intersections of the cycles. By using a digraph variant of this concept, we prove that Eulerian digraphs which admit a simple cycle intersection graph not only adhere to the Second Neighborhood Conjecture, but that
Styles APA, Harvard, Vancouver, ISO, etc.
2

Chiaselotti, G., and T. Gentile. "Intersection properties of maximal directed cuts in digraphs." Discrete Mathematics 340, no. 1 (2017): 3171–75. http://dx.doi.org/10.1016/j.disc.2016.07.003.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
3

Liu, Xujun, Roberto Assis Machado, and Olgica Milenkovic. "Directed Intersection Representations and the Information Content of Digraphs." IEEE Transactions on Information Theory 67, no. 1 (2021): 347–57. http://dx.doi.org/10.1109/tit.2020.3033168.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
4

Lin, In-Jen, Malay K. Sen, and Douglas B. West. "Intersection representation of digraphs in trees with few leaves." Journal of Graph Theory 32, no. 4 (1999): 340–53. http://dx.doi.org/10.1002/(sici)1097-0118(199912)32:4<340::aid-jgt3>3.0.co;2-r.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
5

Bahadir, Selim, and Elvan Ceyhan. "A classification of isomorphism-invariant random digraphs." Contributions to Discrete Mathematics 15, no. 3 (2020): 43–74. http://dx.doi.org/10.55016/ojs/cdm.v15i3.62742.

Texte intégral
Résumé :
We classify isomorphism-invariant random digraphs \linebreak (IIRDs) according to where randomness lies, namely, on arcs, vertices, vertices and arcs together as arc random digraphs (ARD), vertex random digraphs (VRD), vertex-arc random digraphs (VARD) as an extension of the classification of isomorphism-invariant random graphs (IIRGs) \cite{beer:2011}, and introduce randomness in direction (together with arcs, vertices, etc.) also which in turn yield direction random digraphs (DRDs) and its variants, respectively. We demonstrate that for the number of vertices $n\ge 4$, ARDs and VRDs are mutu
Styles APA, Harvard, Vancouver, ISO, etc.
6

Akram, Muhammad, Wieslaw A. Dudek, and M. Murtaza Yousaf. "Regularity in Vague Intersection Graphs and Vague Line Graphs." Abstract and Applied Analysis 2014 (2014): 1–10. http://dx.doi.org/10.1155/2014/525389.

Texte intégral
Résumé :
Fuzzy graph theory is commonly used in computer science applications, particularly in database theory, data mining, neural networks, expert systems, cluster analysis, control theory, and image capturing. A vague graph is a generalized structure of a fuzzy graph that gives more precision, flexibility, and compatibility to a system when compared with systems that are designed using fuzzy graphs. In this paper, we introduce the notion of vague line graphs, and certain types of vague line graphs and present some of their properties. We also discuss an example application of vague digraphs.
Styles APA, Harvard, Vancouver, ISO, etc.
7

K. Rekha. "Structures of Nano-Topologies Via Graphs in the Human Double Circulation System." Communications on Applied Nonlinear Analysis 32, no. 6s (2025): 186–99. https://doi.org/10.52783/cana.v32.3286.

Texte intégral
Résumé :
Introduction: The key theme of present research work is to propose an initial left (resp. right) neighbourhood system for an ordering on nano-topological spaces. Based on these neighbourhoods, we explain how the connection between nano-topological spaces and digraph theory may be used in the study of human double circulation system. Objectives: The“most current findings and medical application methods utilize graph theory to demonstrate certain complicated structures with advanced application trends. The basis of this work is the creation of a“nano-topological structures for the supremacy posi
Styles APA, Harvard, Vancouver, ISO, etc.
8

Jr, Walter D. Morris,. "Acyclic digraphs giving rise to complete intersections." Journal of Commutative Algebra 11, no. 2 (2019): 241–64. http://dx.doi.org/10.1216/jca-2019-11-2-241.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
9

MCCLURE, MARK. "INTERSECTIONS OF SELF-SIMILAR SETS." Fractals 16, no. 02 (2008): 187–97. http://dx.doi.org/10.1142/s0218348x08003909.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
10

Szegő, László. "On covering intersecting set-systems by digraphs." Discrete Mathematics 234, no. 1-3 (2001): 187–89. http://dx.doi.org/10.1016/s0012-365x(00)00381-2.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
Plus de sources

Thèses sur le sujet "Intersection digraphs"

1

Das, Sipra. "Intersection digraphs: an analogue of intersection graphs." Thesis, University of North Bengal, 1990. http://hdl.handle.net/123456789/580.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.

Chapitres de livres sur le sujet "Intersection digraphs"

1

Zamfirescu, Christina M. D. "Transformations of Digraphs Viewed as Intersection Digraphs." In Convexity and Discrete Geometry Including Graph Theory. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-28186-5_2.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
2

Caucchiolo, Andrea, and Ferdinando Cicalese. "On the Intractability Landscape of Digraph Intersection Representations." In Lecture Notes in Computer Science. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-06678-8_20.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
3

Sinha, Kalyan, and Pinaki Majumdar. "Neutrosophic Soft Digraph." In Advances in Data Mining and Database Management. IGI Global, 2020. http://dx.doi.org/10.4018/978-1-7998-1313-2.ch012.

Texte intégral
Résumé :
Neutrosophic soft sets are an important tool to deal with the uncertainty-based real and scientific problems. In this chapter, the idea of neutrosophic soft (NS) digraph has been developed. These digraphs are mainly the graphical representation of neutrosophic soft sets. A graphical study of various set theoretic operations such as union, intersection, complement, cross product, etc. are shown here. Also, some properties of NS digraphs along with theoretical concepts are shown here. In the last part of the chapter, a decision-making problem has been solved with the help of NS digraphs. Also, a
Styles APA, Harvard, Vancouver, ISO, etc.

Actes de conférences sur le sujet "Intersection digraphs"

1

Kostochka, Alexandr V., Xujun Liu, Roberto Machado, and Olgica Milenkovic. "Directed Intersection Representations and the Information Content of Digraphs." In 2019 IEEE International Symposium on Information Theory (ISIT). IEEE, 2019. http://dx.doi.org/10.1109/isit.2019.8849253.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
2

Markowski, Konrad Andrzej, and Krzysztof Hryniow. "Finding a set of (A, B, C, D) realizations for single-input multiple-output dynamic system: First approach using digraph-based method for solutions with intersection vertex." In 2017 22nd International Conference on Methods and Models in Automation and Robotics (MMAR). IEEE, 2017. http://dx.doi.org/10.1109/mmar.2017.8046802.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
Vous pouvez également être intéressé par les bibliographies sur le sujet « Intersection digraphs » pour d’autres types de sources :
Articles de revues
Nous offrons des réductions sur tous les plans premium pour les auteurs dont les œuvres sont incluses dans des sélections littéraires thématiques. Contactez-nous pour obtenir un code promo unique!

Vers la bibliographie