Relevant bibliographies by topics / Intersection digraphs / Journal articles
To see the other types of publications on this topic, follow the link: Intersection digraphs.

Journal articles on the topic 'Intersection digraphs'

Author: Grafiati
Published: 18 May 2024
Last updated: 31 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 19 journal articles for your research on the topic 'Intersection digraphs.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

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.

Full text
Abstract:
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
APA, Harvard, Vancouver, ISO, and other styles
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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
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.

Full text
Abstract:
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
APA, Harvard, Vancouver, ISO, and other styles
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.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
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.

Full text
Abstract:
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
APA, Harvard, Vancouver, ISO, and other styles
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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
11

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

Full text
Abstract:
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 di
APA, Harvard, Vancouver, ISO, and other styles
12

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
13

Bloznelis, Mindaugas. "A random intersection digraph: Indegree and outdegree distributions." Discrete Mathematics 310, no. 19 (2010): 2560–66. http://dx.doi.org/10.1016/j.disc.2010.06.018.

Full text
APA, Harvard, Vancouver, ISO, and other styles
14

Por, Lip Yee, Chin Soon Ku, and Tan Fong Ang. "Preventing Shoulder-Surfing Attacks using Digraph Substitution Rules and Pass-Image Output Feedback." Symmetry 11, no. 9 (2019): 1087. http://dx.doi.org/10.3390/sym11091087.

Full text
Abstract:
In this paper, we focus on methods to prevent shoulder-surfing attacks. We initially adopted digraph substitution rules from PlayFair cipher as our proposed method. PlayFair cipher is a modern cryptography method, which exists at the intersection of the disciplines of mathematics and computer science. However, according to our preliminary study it was insufficient to prevent shoulder-surfing attacks. Thus, a new method had to be proposed. In this new proposed method, we improvised the digraph substitution rules and used these rules together with an output feedback method to determine a pass-im
APA, Harvard, Vancouver, ISO, and other styles
15

Strnad, William. "ON SHADOW AND FORM: KOREAN NATIONALISM’S DIGRAPHIC CONFLICT." International Journal of Korean Humanities and Social Sciences 2 (November 1, 2016): 87–122. http://dx.doi.org/10.14746/kr.2016.02.06.

Full text
Abstract:
This paper is an examination of the many points of intersection between Korean nationalism in both Koreas, and Chinese characters (Hanja), as well as a contextualization of the historical and, at times, antithetical relationship or binary consisting of Hanja and Han’gŭl (Chosŏn’gŭl). Emerging from liberation the two Korean states over the next several decades would “engage” Hanja with diverse and fluctuating positions and approaches at different times. These responses have ranged from the abolition of Hanja or the enforcement of Han’gŭl (Chosŏn’gŭl) exclusivity, to the re-establishment and str
APA, Harvard, Vancouver, ISO, and other styles
16

Jaffke, Lars, O‐joung Kwon, and Jan Arne Telle. "Classes of intersection digraphs with good algorithmic properties." Journal of Graph Theory, December 18, 2023. http://dx.doi.org/10.1002/jgt.23065.

Full text
Abstract:
AbstractWhile intersection graphs play a central role in the algorithmic analysis of hard problems on undirected graphs, the role of intersection digraphs in algorithms is much less understood. We present several contributions towards a better understanding of the algorithmic treatment of intersection digraphs. First, we introduce natural classes of intersection digraphs that generalize several classes studied in the literature. Second, we define the directed locally checkable vertex (DLCV) problems, which capture many well‐studied problems on digraphs, such as (Independent) Dominating Set, Ke
APA, Harvard, Vancouver, ISO, and other styles
17

Abdi, Ahmad, Gérard Cornuéjols, and Giacomo Zambelli. "Arc Connectivity and Submodular Flows in Digraphs." Combinatorica, May 28, 2024. http://dx.doi.org/10.1007/s00493-024-00108-0.

Full text
Abstract:
AbstractLet $$D=(V,A)$$ D = ( V , A ) be a digraph. For an integer $$k\ge 1$$ k ≥ 1 , a k-arc-connected flip is an arc subset of D such that after reversing the arcs in it the digraph becomes (strongly) k-arc-connected. The first main result of this paper introduces a sufficient condition for the existence of a k-arc-connected flip that is also a submodular flow for a crossing submodular function. More specifically, given some integer $$\tau \ge 1$$ τ ≥ 1 , suppose $$d_A^+(U)+(\frac{\tau }{k}-1)d_A^-(U)\ge \tau $$ d A + ( U ) + ( τ k - 1 ) d A - ( U ) ≥ τ for all $$U\subsetneq V, U\ne \emptyse
APA, Harvard, Vancouver, ISO, and other styles
18

Bergougnoux, Benjamin, Eduard Eiben, Robert Ganian, Sebastian Ordyniak, and M. S. Ramanujan. "Towards a Polynomial Kernel for Directed Feedback Vertex Set." Algorithmica, November 4, 2020. http://dx.doi.org/10.1007/s00453-020-00777-5.

Full text
Abstract:
Abstract In the Directed Feedback Vertex Set (DFVS) problem, the input is a directed graph D and an integer k. The objective is to determine whether there exists a set of at most k vertices intersecting every directed cycle of D. DFVS was shown to be fixed-parameter tractable when parameterized by solution size by Chen et al. (J ACM 55(5):177–186, 2008); since then, the existence of a polynomial kernel for this problem has become one of the largest open problems in the area of parameterized algorithmics. Since this problem has remained open in spite of the best efforts of a number of prominent
APA, Harvard, Vancouver, ISO, and other styles
19

Peixoto, Ana Rita, Ana de Almeida, Nuno António, Fernando Batista, Ricardo Ribeiro, and Elsa Cardoso. "Unlocking the power of Twitter communities for startups." Applied Network Science 8, no. 1 (2023). http://dx.doi.org/10.1007/s41109-023-00593-0.

Full text
Abstract:
AbstractSocial media platforms offer cost-effective digital marketing opportunities to monitor the market, create user communities, and spread positive opinions. They allow companies with fewer budgets, like startups, to achieve their goals and grow. In fact, studies found that startups with active engagement on those platforms have a higher chance of succeeding and receiving funding from venture capitalists. Our study explores how startups utilize social media platforms to foster social communities. We also aim to characterize the individuals within these communities. The findings from this s
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography