Gotowe bibliografie tematyczne / Intersection digraphs

Gotowa bibliografia na temat „Intersection digraphs”

Autor: Grafiati
Data publikacji: 18 maja 2024

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Spis treści

Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Intersection digraphs”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Artykuły w czasopismach na temat "Intersection digraphs"

1

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

Pełny tekst źródła
Streszczenie:
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 local simplicity can, in some cases, also imply the existence of a Seymour vertex in the original digraph.
Style APA, Harvard, Vancouver, ISO itp.
2

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

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

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

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

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

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Akram, Muhammad, Wieslaw A. Dudek i 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.

Pełny tekst źródła
Streszczenie:
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.
Style APA, Harvard, Vancouver, ISO itp.
6

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

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

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

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

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

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Jonsson, Jakob. "On the number of Euler trails in directed graphs". MATHEMATICA SCANDINAVICA 90, nr 2 (1.06.2002): 191. http://dx.doi.org/10.7146/math.scand.a-14370.

Pełny tekst źródła
Streszczenie:
Let $G$ be an Eulerian digraph with all in- and out-degrees equal to 2, and let $\pi$ be an Euler trail in $G$. We consider an intersection matrix $\boldsymbol {L}(\pi)$ with the property that the determinant of $\boldsymbol{L}(\pi) + \boldsymbol{I}$ is equal to the number of Euler trails in $G$; $\boldsymbol{I}$ denotes the identity matrix. We show that if the inverse of $\boldsymbol{L}(\pi)$ exists, then $\boldsymbol{L}^{-1}(\pi) = \boldsymbol{L}(\sigma)$ for a certain Euler trail $\sigma$ in $G$. Furthermore, we use properties of the intersection matrix to prove some results about how to divide the set of Euler trails in a digraph into smaller sets of the same size.
Style APA, Harvard, Vancouver, ISO itp.
10

Kurauskas, Valentas. "On small subgraphs in a random intersection digraph". Discrete Mathematics 313, nr 7 (kwiecień 2013): 872–85. http://dx.doi.org/10.1016/j.disc.2012.12.024.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
Więcej źródeł

Rozprawy doktorskie na temat "Intersection digraphs"

1

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

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.

Części książek na temat "Intersection digraphs"

1

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

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

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

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

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

Pełny tekst źródła
Streszczenie:
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, an algorithm is provided to solve the decision-making problems using NS digraph. Finally, a comparative study with proposed future work along this direction has been provided.
Style APA, Harvard, Vancouver, ISO itp.

Streszczenia konferencji na temat "Intersection digraphs"

1

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

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Markowski, Konrad Andrzej, i 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". W 2017 22nd International Conference on Methods and Models in Automation and Robotics (MMAR). IEEE, 2017. http://dx.doi.org/10.1109/mmar.2017.8046802.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
Możesz być także zainteresowany rozszerzonymi bibliografiami na temat „Intersection digraphs” dla poszczególnych typów źródeł:
Artykuły w czasopismach
Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!

Do bibliografii