CINXE.COM

<!DOCTYPE html> <html lang="en" dir="ltr"> <head>  <script async src="https://www.googletagmanager.com/gtag/js?id=G-P63WKM1TM1"></script> <script> window.dataLayer = window.dataLayer || []; function gtag(){dataLayer.push(arguments);} gtag('js', new Date()); gtag('config', 'G-P63WKM1TM1'); </script>  <script type="text/javascript" > (function(m,e,t,r,i,k,a){m[i]=m[i]||function(){(m[i].a=m[i].a||[]).push(arguments)}; m[i].l=1*new Date(); for (var j = 0; j < document.scripts.length; j++) {if (document.scripts[j].src === r) { return; }} k=e.createElement(t),a=e.getElementsByTagName(t)[0],k.async=1,k.src=r,a.parentNode.insertBefore(k,a)}) (window, document, "script", "https://mc.yandex.ru/metrika/tag.js", "ym"); ym(55165297, "init", { clickmap:false, trackLinks:true, accurateTrackBounce:true, webvisor:false }); </script> <noscript><div><img src="https://mc.yandex.ru/watch/55165297" style="position:absolute; left:-9999px;" alt="" /></div></noscript>    <title>Search results for: subdivision graphs</title> <meta name="description" content="Search results for: subdivision graphs"> <meta name="keywords" content="subdivision graphs"> <meta name="viewport" content="width=device-width, initial-scale=1, minimum-scale=1, maximum-scale=1, user-scalable=no"> <meta charset="utf-8"> <link href="https://cdn.waset.org/favicon.ico" type="image/x-icon" rel="shortcut icon"> <link href="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/css/bootstrap.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/plugins/fontawesome/css/all.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/css/site.css?v=150220211555" rel="stylesheet"> </head> <body> <header> <div class="container"> <nav class="navbar navbar-expand-lg navbar-light"> <a class="navbar-brand" href="https://waset.org"> <img src="https://cdn.waset.org/static/images/wasetc.png" alt="Open Science Research Excellence" title="Open Science Research Excellence" /> </a> <button class="d-block d-lg-none navbar-toggler ml-auto" type="button" data-toggle="collapse" data-target="#navbarMenu" aria-controls="navbarMenu" aria-expanded="false" aria-label="Toggle navigation"> <span class="navbar-toggler-icon"></span> </button> <div class="w-100"> <div class="d-none d-lg-flex flex-row-reverse"> <form method="get" action="https://waset.org/search" class="form-inline my-2 my-lg-0"> <input class="form-control mr-sm-2" type="search" placeholder="Search Conferences" value="subdivision graphs" name="q" aria-label="Search"> <button class="btn btn-light my-2 my-sm-0" type="submit"><i class="fas fa-search"></i></button> </form> </div> <div class="collapse navbar-collapse mt-1" id="navbarMenu"> <ul class="navbar-nav ml-auto align-items-center" id="mainNavMenu"> <li class="nav-item"> <a class="nav-link" href="https://waset.org/conferences" title="Conferences in 2024/2025/2026">Conferences</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/disciplines" title="Disciplines">Disciplines</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/committees" rel="nofollow">Committees</a> </li> <li class="nav-item dropdown"> <a class="nav-link dropdown-toggle" href="#" id="navbarDropdownPublications" role="button" data-toggle="dropdown" aria-haspopup="true" aria-expanded="false"> Publications </a> <div class="dropdown-menu" aria-labelledby="navbarDropdownPublications"> <a class="dropdown-item" href="https://publications.waset.org/abstracts">Abstracts</a> <a class="dropdown-item" href="https://publications.waset.org">Periodicals</a> <a class="dropdown-item" href="https://publications.waset.org/archive">Archive</a> </div> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/page/support" title="Support">Support</a> </li> </ul> </div> </div> </nav> </div> </header> <main> <div class="container mt-4"> <div class="row"> <div class="col-md-9 mx-auto"> <form method="get" action="https://publications.waset.org/abstracts/search"> <div id="custom-search-input"> <div class="input-group"> <i class="fas fa-search"></i> <input type="text" class="search-query" name="q" placeholder="Author, Title, Abstract, Keywords" value="subdivision graphs"> <input type="submit" class="btn_search" value="Search"> </div> </div> </form> </div> </div> <div class="row mt-3"> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Commenced</strong> in January 2007</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Frequency:</strong> Monthly</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Edition:</strong> International</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Paper Count:</strong> 361</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: subdivision graphs</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">361</span> Curve Designing Using an Approximating 4-Point C^2 Ternary Non-Stationary Subdivision Scheme</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Muhammad%20Younis">Muhammad Younis</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A ternary 4-point approximating non-stationary subdivision scheme has been introduced that generates the family of $C^2$ limiting curves. The theory of asymptotic equivalence is being used to analyze the convergence and smoothness of the scheme. The comparison of the proposed scheme has been demonstrated using different examples with the existing 4-point ternary approximating schemes, which shows that the limit curves of the proposed scheme behave more pleasantly and can generate conic sections as well. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=ternary" title="ternary">ternary</a>, <a href="https://publications.waset.org/abstracts/search?q=non-stationary" title=" non-stationary"> non-stationary</a>, <a href="https://publications.waset.org/abstracts/search?q=approximation%20subdivision%20scheme" title=" approximation subdivision scheme"> approximation subdivision scheme</a>, <a href="https://publications.waset.org/abstracts/search?q=convergence%20and%20smoothness" title=" convergence and smoothness"> convergence and smoothness</a> </p> <a href="https://publications.waset.org/abstracts/24448/curve-designing-using-an-approximating-4-point-c2-ternary-non-stationary-subdivision-scheme" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/24448.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">477</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">360</span> Domination Parameters of Middle Graphs: Connected and Outer-Connected Perspectives</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Behnaz%20Pahlousay">Behnaz Pahlousay</a>, <a href="https://publications.waset.org/abstracts/search?q=Farshad%20Kazemnejad"> Farshad Kazemnejad</a>, <a href="https://publications.waset.org/abstracts/search?q=Elisa%20Palezzato"> Elisa Palezzato</a>, <a href="https://publications.waset.org/abstracts/search?q=Michele%20Torielli"> Michele Torielli</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we study the notions of connected domination number and of outer-connected domination number for middle graphs. Indeed, we obtain tight bounds for these numbers in terms of the order of the middle graph M(G). We also compute the outer-connected domination number of some families of graphs such as star graphs, cycle graphs, wheel graphs, complete graphs, complete bipartite graphs and some operation on graphs, explicitly. Moreover, some Nordhaus-Gaddum-like relations are presented for the outer-connected domination number of middle graphs. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=connected%20domination%20number" title="connected domination number">connected domination number</a>, <a href="https://publications.waset.org/abstracts/search?q=outer-connected%20dom-%20ination%20number" title=" outer-connected dom- ination number"> outer-connected dom- ination number</a>, <a href="https://publications.waset.org/abstracts/search?q=domination%20number" title=" domination number"> domination number</a>, <a href="https://publications.waset.org/abstracts/search?q=middle%20graph" title=" middle graph"> middle graph</a>, <a href="https://publications.waset.org/abstracts/search?q=nordhaus-%20gaddum-like%20relation." title=" nordhaus- gaddum-like relation."> nordhaus- gaddum-like relation.</a> </p> <a href="https://publications.waset.org/abstracts/189196/domination-parameters-of-middle-graphs-connected-and-outer-connected-perspectives" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/189196.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">37</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">359</span> Eccentric Connectivity Index, First and Second Zagreb Indices of Corona Graph</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=A.%20Kulandai%20Therese">A. Kulandai Therese</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The eccentric connectivity index based on degree and eccentricity of the vertices of a graph is a widely used graph invariant in mathematics.In this paper, we present the explicit eccentric connectivity index, first and second Zagreb indices for a Corona graph and sub division-related corona graphs. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=corona%20graph" title="corona graph">corona graph</a>, <a href="https://publications.waset.org/abstracts/search?q=degree" title=" degree"> degree</a>, <a href="https://publications.waset.org/abstracts/search?q=eccentricity" title=" eccentricity"> eccentricity</a>, <a href="https://publications.waset.org/abstracts/search?q=eccentric%20connectivity%20index" title=" eccentric connectivity index"> eccentric connectivity index</a>, <a href="https://publications.waset.org/abstracts/search?q=first%20zagreb%20index" title=" first zagreb index"> first zagreb index</a>, <a href="https://publications.waset.org/abstracts/search?q=second%20zagreb%20index" title=" second zagreb index"> second zagreb index</a>, <a href="https://publications.waset.org/abstracts/search?q=subdivision%20graphs" title=" subdivision graphs"> subdivision graphs</a> </p> <a href="https://publications.waset.org/abstracts/16768/eccentric-connectivity-index-first-and-second-zagreb-indices-of-corona-graph" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/16768.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">337</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">358</span> Semirings of Graphs: An Approach Towards the Algebra of Graphs</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Gete%20Umbrey">Gete Umbrey</a>, <a href="https://publications.waset.org/abstracts/search?q=Saifur%20Rahman"> Saifur Rahman</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Graphs are found to be most capable in computing, and its abstract structures have been applied in some specific computations and algorithms like in phase encoding controller, processor microcontroller, and synthesis of a CMOS switching network, etc. Being motivated by these works, we develop an independent approach to study semiring structures and various properties by defining the binary operations which in fact, seems analogous to an existing definition in some sense but with a different approach. This work emphasizes specifically on the construction of semigroup and semiring structures on the set of undirected graphs, and their properties are investigated therein. It is expected that the investigation done here may have some interesting applications in theoretical computer science, networking and decision making, and also on joining of two network systems. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=graphs" title="graphs">graphs</a>, <a href="https://publications.waset.org/abstracts/search?q=join%20and%20union%20of%20graphs" title=" join and union of graphs"> join and union of graphs</a>, <a href="https://publications.waset.org/abstracts/search?q=semiring" title=" semiring"> semiring</a>, <a href="https://publications.waset.org/abstracts/search?q=weighted%20graphs" title=" weighted graphs"> weighted graphs</a> </p> <a href="https://publications.waset.org/abstracts/103053/semirings-of-graphs-an-approach-towards-the-algebra-of-graphs" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/103053.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">148</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">357</span> Extremal Laplacian Energy of Threshold Graphs</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Seyed%20Ahmad%20Mojallal">Seyed Ahmad Mojallal</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Let G be a connected threshold graph of order n with m edges and trace T. In this talk we give a lower bound on Laplacian energy in terms of n, m, and T of G. From this we determine the threshold graphs with the first four minimal Laplacian energies. We also list the first 20 minimal Laplacian energies among threshold graphs. Let σ=σ(G) be the number of Laplacian eigenvalues greater than or equal to average degree of graph G. Using this concept, we obtain the threshold graphs with the largest and the second largest Laplacian energies. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Laplacian%20eigenvalues" title="Laplacian eigenvalues">Laplacian eigenvalues</a>, <a href="https://publications.waset.org/abstracts/search?q=Laplacian%20energy" title=" Laplacian energy"> Laplacian energy</a>, <a href="https://publications.waset.org/abstracts/search?q=threshold%20graphs" title=" threshold graphs"> threshold graphs</a>, <a href="https://publications.waset.org/abstracts/search?q=extremal%20graphs" title=" extremal graphs"> extremal graphs</a> </p> <a href="https://publications.waset.org/abstracts/41332/extremal-laplacian-energy-of-threshold-graphs" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/41332.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">388</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">356</span> An Improved Method to Compute Sparse Graphs for Traveling Salesman Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Y.%20Wang">Y. Wang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The Traveling salesman problem (TSP) is NP-hard in combinatorial optimization. The research shows the algorithms for TSP on the sparse graphs have the shorter computation time than those for TSP according to the complete graphs. We present an improved iterative algorithm to compute the sparse graphs for TSP by frequency graphs computed with frequency quadrilaterals. The iterative algorithm is enhanced by adjusting two parameters of the algorithm. The computation time of the algorithm is <em>O</em>(<em>CN</em><sub>max</sub><em>n</em><sup>2</sup>) where <em>C</em> is the iterations, <em>N</em><sub>max</sub> is the maximum number of frequency quadrilaterals containing each edge and <em>n</em> is the scale of TSP. The experimental results showed the computed sparse graphs generally have less than 5<em>n</em> edges for most of these Euclidean instances. Moreover, the maximum degree and minimum degree of the vertices in the sparse graphs do not have much difference. Thus, the computation time of the methods to resolve the TSP on these sparse graphs will be greatly reduced. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=frequency%20quadrilateral" title="frequency quadrilateral">frequency quadrilateral</a>, <a href="https://publications.waset.org/abstracts/search?q=iterative%20algorithm" title=" iterative algorithm"> iterative algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=sparse%20graph" title=" sparse graph"> sparse graph</a>, <a href="https://publications.waset.org/abstracts/search?q=traveling%20salesman%20problem" title=" traveling salesman problem"> traveling salesman problem</a> </p> <a href="https://publications.waset.org/abstracts/82737/an-improved-method-to-compute-sparse-graphs-for-traveling-salesman-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/82737.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">233</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">355</span> Informal Land Subdivision and Its Implications for Infrastructural Development in Kano Metropolis, Nigeria</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=A.%20A.%20Yakub">A. A. Yakub</a>, <a href="https://publications.waset.org/abstracts/search?q=Omavudu%20Ikogho"> Omavudu Ikogho</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Land subdivision in most peri-urban areas of Kano metropolis is the entrenched prerogative of ‘KAFADA’ a group of informal plot partitioners who oversee the demarcation of mainly previous farmland into residential plots popularly called 'awon igiya' for those in need. With time these areas are engulfed in the milieu of the rapidly expanding urban landscape and form clusters of poorly planned settlements with tendencies to become future slums. This paper studies the practice of informal land subdivision in Kano metropolis with emphasis on the practitioners, the institutional framework, and the demand and supply scenario that sustains this trend as well as the extent of infrastructural development in these areas. Using three selected informally planned settlements as case-studies, a series of interviews and questionnaires are administered to 'KAFADA,' residents and the state land officers to generate data in these areas. Another set of data was similarly generated in three government subdivided residential layouts, and both sets analysed comparatively. The findings identify varying levels of infrastructural deficits in the informal communities compared to the planned neighbourhoods which are seen to be as a result of the absence of government participation and an informal subdivision process which did not provide for proper planning standards. This study recommends that the regulatory agencies concerned register and partner with KAFADA to ensure that minimal planning standards are maintained in future settlements. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=peri-urban" title="peri-urban">peri-urban</a>, <a href="https://publications.waset.org/abstracts/search?q=informal%20land%20markets" title=" informal land markets"> informal land markets</a>, <a href="https://publications.waset.org/abstracts/search?q=land%20subdivision" title=" land subdivision"> land subdivision</a>, <a href="https://publications.waset.org/abstracts/search?q=infrastructure" title=" infrastructure"> infrastructure</a> </p> <a href="https://publications.waset.org/abstracts/63590/informal-land-subdivision-and-its-implications-for-infrastructural-development-in-kano-metropolis-nigeria" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/63590.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">283</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">354</span> 2D Structured Non-Cyclic Fuzzy Graphs</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=T.%20Pathinathan">T. Pathinathan</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20Peter"> M. Peter</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Fuzzy graphs incorporate concepts from graph theory with fuzzy principles. In this paper, we make a study on the properties of fuzzy graphs which are non-cyclic and are of two-dimensional in structure. In particular, this paper presents 2D structure or the structure of double layer for a non-cyclic fuzzy graph whose underlying crisp graph is non-cyclic. In any graph structure, introducing 2D structure may lead to an inherent cycle. We propose relevant conditions for 2D structured non-cyclic fuzzy graphs. These conditions are extended even to fuzzy graphs of the 3D structure. General theoretical properties that are studied for any fuzzy graph are verified to 2D structured or double layered fuzzy graphs. Concepts like Order, Degree, Strong and Size for a fuzzy graph are studied for 2D structured or double layered non-cyclic fuzzy graphs. Using different types of fuzzy graphs, the proposed concepts relating to 2D structured fuzzy graphs are verified. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=double%20layered%20fuzzy%20graph" title="double layered fuzzy graph">double layered fuzzy graph</a>, <a href="https://publications.waset.org/abstracts/search?q=double%20layered%20non%E2%80%93cyclic%20fuzzy%20graph" title=" double layered non–cyclic fuzzy graph"> double layered non–cyclic fuzzy graph</a>, <a href="https://publications.waset.org/abstracts/search?q=order" title=" order"> order</a>, <a href="https://publications.waset.org/abstracts/search?q=degree%20and%20size" title=" degree and size"> degree and size</a> </p> <a href="https://publications.waset.org/abstracts/80562/2d-structured-non-cyclic-fuzzy-graphs" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/80562.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">400</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">353</span> Computing Maximum Uniquely Restricted Matchings in Restricted Interval Graphs</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Swapnil%20Gupta">Swapnil Gupta</a>, <a href="https://publications.waset.org/abstracts/search?q=C.%20Pandu%20Rangan"> C. Pandu Rangan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A uniquely restricted matching is defined to be a matching M whose matched vertices induces a sub-graph which has only one perfect matching. In this paper, we make progress on the open question of the status of this problem on interval graphs (graphs obtained as the intersection graph of intervals on a line). We give an algorithm to compute maximum cardinality uniquely restricted matchings on certain sub-classes of interval graphs. We consider two sub-classes of interval graphs, the former contained in the latter, and give O(|E|^2) time algorithms for both of them. It is to be noted that both sub-classes are incomparable to proper interval graphs (graphs obtained as the intersection graph of intervals in which no interval completely contains another interval), on which the problem can be solved in polynomial time. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=uniquely%20restricted%20matching" title="uniquely restricted matching">uniquely restricted matching</a>, <a href="https://publications.waset.org/abstracts/search?q=interval%20graph" title=" interval graph"> interval graph</a>, <a href="https://publications.waset.org/abstracts/search?q=matching" title=" matching"> matching</a>, <a href="https://publications.waset.org/abstracts/search?q=induced%20matching" title=" induced matching"> induced matching</a>, <a href="https://publications.waset.org/abstracts/search?q=witness%20counting" title=" witness counting"> witness counting</a> </p> <a href="https://publications.waset.org/abstracts/45203/computing-maximum-uniquely-restricted-matchings-in-restricted-interval-graphs" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/45203.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">389</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">352</span> Building 1-Well-Covered Graphs by Corona, Join, and Rooted Product of Graphs</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Vadim%20E.%20Levit">Vadim E. Levit</a>, <a href="https://publications.waset.org/abstracts/search?q=Eugen%20Mandrescu"> Eugen Mandrescu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A graph is well-covered if all its maximal independent sets are of the same size. A well-covered graph is 1-well-covered if deletion of every vertex of the graph leaves it well-covered. It is known that a graph without isolated vertices is 1-well-covered if and only if every two disjoint independent sets are included in two disjoint maximum independent sets. Well-covered graphs are related to combinatorial commutative algebra (e.g., every Cohen-Macaulay graph is well-covered, while each Gorenstein graph without isolated vertices is 1-well-covered). Our intent is to construct several infinite families of 1-well-covered graphs using the following known graph operations: corona, join, and rooted product of graphs. Adopting some known techniques used to advantage for well-covered graphs, one can prove that: if the graph G has no isolated vertices, then the corona of G and H is 1-well-covered if and only if H is a complete graph of order two at least; the join of the graphs G and H is 1-well-covered if and only if G and H have the same independence number and both are 1-well-covered; if H satisfies the property that every three pairwise disjoint independent sets are included in three pairwise disjoint maximum independent sets, then the rooted product of G and H is 1-well-covered, for every graph G. These findings show not only how to generate some more families of 1-well-covered graphs, but also that, to this aim, sometimes, one may use graphs that are not necessarily 1-well-covered. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=maximum%20independent%20set" title="maximum independent set">maximum independent set</a>, <a href="https://publications.waset.org/abstracts/search?q=corona" title=" corona"> corona</a>, <a href="https://publications.waset.org/abstracts/search?q=concatenation" title=" concatenation"> concatenation</a>, <a href="https://publications.waset.org/abstracts/search?q=join" title=" join"> join</a>, <a href="https://publications.waset.org/abstracts/search?q=well-covered%20graph" title=" well-covered graph"> well-covered graph</a> </p> <a href="https://publications.waset.org/abstracts/86859/building-1-well-covered-graphs-by-corona-join-and-rooted-product-of-graphs" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/86859.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">208</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">351</span> Reductions of Control Flow Graphs</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Robert%20Gold">Robert Gold</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Control ﬂow graphs are a well-known representation of the sequential control ﬂow structure of programs with a multitude of applications. Not only single functions but also sets of functions or complete programs can be modelled by control ﬂow graphs. In this case the size of the graphs can grow considerably and thus makes it difﬁcult for software engineers to analyse the control ﬂow. Graph reductions are helpful in this situation. In this paper we deﬁne reductions to subsets of nodes. Since executions of programs are represented by paths through the control ﬂow graphs, paths should be preserved. Furthermore, the composition of reductions makes a stepwise analysis approach possible. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=control%20flow%20graph" title="control flow graph">control flow graph</a>, <a href="https://publications.waset.org/abstracts/search?q=graph%20reduction" title=" graph reduction"> graph reduction</a>, <a href="https://publications.waset.org/abstracts/search?q=software%20engineering" title=" software engineering"> software engineering</a>, <a href="https://publications.waset.org/abstracts/search?q=software%20applications" title=" software applications"> software applications</a> </p> <a href="https://publications.waset.org/abstracts/5568/reductions-of-control-flow-graphs" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/5568.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">552</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">350</span> Nullity of t-Tupple Graphs</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Khidir%20R.%20Sharaf">Khidir R. Sharaf</a>, <a href="https://publications.waset.org/abstracts/search?q=Didar%20A.%20Ali"> Didar A. Ali</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The nullity η (G) of a graph is the occurrence of zero as an eigenvalue in its spectra. A zero-sum weighting of a graph G is real valued function, say f from vertices of G to the set of real numbers, provided that for each vertex of G the summation of the weights f (w) over all neighborhood w of v is zero for each v in G.A high zero-sum weighting of G is one that uses maximum number of non-zero independent variables. If G is graph with an end vertex, and if H is an induced sub-graph of G obtained by deleting this vertex together with the vertex adjacent to it, then, η(G)= η(H). In this paper, a high zero-sum weighting technique and the end vertex procedure are applied to evaluate the nullity of t-tupple and generalized t-tupple graphs are derived and determined for some special types of graphs. Also, we introduce and prove some important results about the t-tupple coalescence, Cartesian and Kronecker products of nut graphs. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=graph%20theory" title="graph theory">graph theory</a>, <a href="https://publications.waset.org/abstracts/search?q=graph%20spectra" title=" graph spectra"> graph spectra</a>, <a href="https://publications.waset.org/abstracts/search?q=nullity%20of%20graphs" title=" nullity of graphs"> nullity of graphs</a>, <a href="https://publications.waset.org/abstracts/search?q=statistic" title=" statistic"> statistic</a> </p> <a href="https://publications.waset.org/abstracts/4759/nullity-of-t-tupple-graphs" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/4759.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">239</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">349</span> On the Zeros of the Degree Polynomial of a Graph</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=S.%20R.%20Nayaka">S. R. Nayaka</a>, <a href="https://publications.waset.org/abstracts/search?q=Putta%20Swamy"> Putta Swamy</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Graph polynomial is one of the algebraic representations of the Graph. The degree polynomial is one of the simple algebraic representations of graphs. The degree polynomial of a graph G of order n is the polynomial Deg(G, x) with the coefficients deg(G,i) where deg(G,i) denotes the number of vertices of degree i in G. In this article, we investigate the behavior of the roots of some families of Graphs in the complex field. We investigate for the graphs having only integral roots. Further, we characterize the graphs having single roots or having real roots and behavior of the polynomial at the particular value is also obtained. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=degree%20polynomial" title="degree polynomial">degree polynomial</a>, <a href="https://publications.waset.org/abstracts/search?q=regular%20graph" title=" regular graph"> regular graph</a>, <a href="https://publications.waset.org/abstracts/search?q=minimum%20and%20maximum%20degree" title=" minimum and maximum degree"> minimum and maximum degree</a>, <a href="https://publications.waset.org/abstracts/search?q=graph%20operations" title=" graph operations"> graph operations</a> </p> <a href="https://publications.waset.org/abstracts/56602/on-the-zeros-of-the-degree-polynomial-of-a-graph" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/56602.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">249</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">348</span> Jordan Curves in the Digital Plane with Respect to the Connectednesses given by Certain Adjacency Graphs</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Josef%20Slapal">Josef Slapal</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Digital images are approximations of real ones and, therefore, to be able to study them, we need the digital plane Z2 to be equipped with a convenient structure that behaves analogously to the Euclidean topology on the real plane. In particular, it is required that such a structure allows for a digital analogue of the Jordan curve theorem. We introduce certain adjacency graphs on the digital plane and prove digital Jordan curves for them thus showing that the graphs provide convenient structures on Z2 for the study and processing of digital images. Further convenient structures including the wellknown Khalimsky and Marcus-Wyse adjacency graphs may be obtained as quotients of the graphs introduced. Since digital Jordan curves represent borders of objects in digital images, the adjacency graphs discussed may be used as background structures on the digital plane for solving the problems of digital image processing that are closely related to borders like border detection, contour filling, pattern recognition, thinning, etc. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=digital%20plane" title="digital plane">digital plane</a>, <a href="https://publications.waset.org/abstracts/search?q=adjacency%20graph" title=" adjacency graph"> adjacency graph</a>, <a href="https://publications.waset.org/abstracts/search?q=Jordan%20curve" title=" Jordan curve"> Jordan curve</a>, <a href="https://publications.waset.org/abstracts/search?q=quotient%20adjacency" title=" quotient adjacency"> quotient adjacency</a> </p> <a href="https://publications.waset.org/abstracts/65454/jordan-curves-in-the-digital-plane-with-respect-to-the-connectednesses-given-by-certain-adjacency-graphs" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/65454.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">379</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">347</span> The Residential Subdivision under the Influence of the Unfinished Densification, Case Study for Subdivisions in Setif, Algeria</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Lacheheb%20Dhia%20Eddine%20Zakaria">Lacheheb Dhia Eddine Zakaria</a>, <a href="https://publications.waset.org/abstracts/search?q=Ballout%20Amor"> Ballout Amor </a> </p> <p class="card-text"><strong>Abstract:</strong></p> Today, it is necessary to be thrifty for its planet, on one hand the space being a rare, nonrenewable resource, and on the other hand the ecological, economic and social cost of the urban sprawl. It is commonly asserted that the promotion of a more compact and dense city has a positive effect in terms of public costs of investment, functioning and costs for the citizens and the users of the city. It is clear that the modes urban development management have to evolve profoundly, in particular towards a densification favourable to the raising of the urban quality through an ideal urban density on the scale of the individual housing estate. The lot as an individual housing estate was adopted as an alternative development model to the collective housing, thought in an anthropocentric perspective to emerge as a quality model where the density plays an important role, by being included in operations of a global coherence, in an optimal organization without forgetting the main importance of the deadlines of construction and the finalization of the works. The image of eternal construction site inflicted to our cities explains the renewed interest for the application of the regulatory framework and the completion of these limited operations without global coherence, which are summed up in our case to a ground cut in plots of land, sold then built independently without being finished, and support the relevance of the essential question of the improvement of the outside aspect bound to the appearance which can be revealed as a so important factor for a better use and a better acceptance of its housing environment, that the ratio of a number of houses on a plot of land or the number of square meters by house. To demonstrate the impact of the completion degree of the subdivision dwellings, roads system and urban public utilities on the density or the densification and therefore on the urban quality, we studied two residential subdivisions, the private subdivision Sellam and the subdivision El Imane with a common situation, and a different land surface, density and cutting, being occupied by various social classes, with different needs and different household average size. The approach of this work is based on the typo morphological analysis to reveal the differences in the degrees of completions of the subdivision’s built environment and on the investigation, by a household’s survey, to demonstrate importance of the degree of completion and to reveal the conditions of qualitative densification favourable and convenient to a better subdivision’s appropriation. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=subdivision" title="subdivision">subdivision</a>, <a href="https://publications.waset.org/abstracts/search?q=degree%20of%20completion" title=" degree of completion"> degree of completion</a>, <a href="https://publications.waset.org/abstracts/search?q=densification" title=" densification"> densification</a>, <a href="https://publications.waset.org/abstracts/search?q=urban%20quality" title=" urban quality"> urban quality</a> </p> <a href="https://publications.waset.org/abstracts/25603/the-residential-subdivision-under-the-influence-of-the-unfinished-densification-case-study-for-subdivisions-in-setif-algeria" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/25603.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">372</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">346</span> On Chvátal’s Conjecture for the Hamiltonicity of 1-Tough Graphs and Their Complements</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Shin-Shin%20Kao">Shin-Shin Kao</a>, <a href="https://publications.waset.org/abstracts/search?q=Yuan-Kang%20Shih"> Yuan-Kang Shih</a>, <a href="https://publications.waset.org/abstracts/search?q=Hsun%20Su"> Hsun Su</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we show that the conjecture of Chv tal, which states that any 1-tough graph is either a Hamiltonian graph or its complement contains a specific graph denoted by F, does not hold in general. More precisely, it is true only for graphs with six or seven vertices, and is false for graphs with eight or more vertices. A theorem is derived as a correction for the conjecture. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=complement" title="complement">complement</a>, <a href="https://publications.waset.org/abstracts/search?q=degree%20sum" title=" degree sum"> degree sum</a>, <a href="https://publications.waset.org/abstracts/search?q=hamiltonian" title=" hamiltonian"> hamiltonian</a>, <a href="https://publications.waset.org/abstracts/search?q=tough" title=" tough"> tough</a> </p> <a href="https://publications.waset.org/abstracts/78455/on-chvatals-conjecture-for-the-hamiltonicity-of-1-tough-graphs-and-their-complements" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/78455.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">289</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">345</span> Prime Graphs of Polynomials and Power Series Over Non-Commutative Rings</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Walaa%20Obaidallah%20Alqarafi">Walaa Obaidallah Alqarafi</a>, <a href="https://publications.waset.org/abstracts/search?q=Wafaa%20Mohammed%20Fakieh"> Wafaa Mohammed Fakieh</a>, <a href="https://publications.waset.org/abstracts/search?q=Alaa%20Abdallah%20Altassan"> Alaa Abdallah Altassan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Algebraic graph theory is defined as a bridge between algebraic structures and graphs. It has several uses in many fields, including chemistry, physics, and computer science. The prime graph is a type of graph associated with a ring R, where the vertex set is the whole ring R, and two vertices x and y are adjacent if either xRy=0 or yRx=0. However, the investigation of the prime graph over rings remains relatively limited. The behavior of this graph in extended rings, like R[x] and R[[x]], where R is a non-commutative ring, deserves more attention because of the wider applicability in algebra and other mathematical fields. To study the prime graphs over polynomials and power series rings, we used a combination of ring-theoretic and graph-theoretic techniques. This paper focuses on two invariants: the diameter and the girth of these graphs. Furthermore, the work discusses how the graph structures change when passing from R to R[x] and R[[x]]. In our study, we found that the set of strong zero-divisors of ring R represents the set of vertices in prime graphs. Based on this discovery, we redefined the vertices of prime graphs using the definition of strong zero divisors. Additionally, our results show that although the prime graphs of R[x] and R[[x]] are comparable to the graph of R, they have different combinatorial characteristics since these extensions contain new strong zero-divisors. In particular, we find conditions in which the diameter and girth of the graphs, as they expand from R to R[x] and R[[x]], do not change or do change. In conclusion, this study shows how extending a non-commutative ring R to R[x] and R[[x]] affects the structure of their prime graphs, particularly in terms of diameter and girth. These findings enhance the understanding of the relationship between ring extensions and graph properties. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=prime%20graph" title="prime graph">prime graph</a>, <a href="https://publications.waset.org/abstracts/search?q=diameter" title=" diameter"> diameter</a>, <a href="https://publications.waset.org/abstracts/search?q=girth" title=" girth"> girth</a>, <a href="https://publications.waset.org/abstracts/search?q=polynomial%20ring" title=" polynomial ring"> polynomial ring</a>, <a href="https://publications.waset.org/abstracts/search?q=power%20series%20ring" title=" power series ring"> power series ring</a> </p> <a href="https://publications.waset.org/abstracts/192430/prime-graphs-of-polynomials-and-power-series-over-non-commutative-rings" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/192430.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">18</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">344</span> Improvement a Lower Bound of Energy for Some Family of Graphs, Related to Determinant of Adjacency Matrix</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Saieed%20%20Akbari">Saieed Akbari</a>, <a href="https://publications.waset.org/abstracts/search?q=Yousef%20Bagheri"> Yousef Bagheri</a>, <a href="https://publications.waset.org/abstracts/search?q=Amir%20Hossein%20Ghodrati"> Amir Hossein Ghodrati</a>, <a href="https://publications.waset.org/abstracts/search?q=Sima%20Saadat%20Akhtar"> Sima Saadat Akhtar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Let G be a simple graph with the vertex set V (G) and with the adjacency matrix A (G). The energy E (G) of G is defined to be the sum of the absolute values of all eigenvalues of A (G). Also let n and m be number of edges and vertices of the graph respectively. A regular graph is a graph where each vertex has the same number of neighbours. Given a graph G, its line graph L(G) is a graph such that each vertex of L(G) represents an edge of G; and two vertices of L(G) are adjacent if and only if their corresponding edges share a common endpoint in G. In this paper we show that for every regular graphs and also for every line graphs such that (G) 3 we have, E(G) 2nm + n 1. Also at the other part of the paper we prove that 2 (G) E(G) for an arbitrary graph G. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=eigenvalues" title="eigenvalues">eigenvalues</a>, <a href="https://publications.waset.org/abstracts/search?q=energy" title=" energy"> energy</a>, <a href="https://publications.waset.org/abstracts/search?q=line%20graphs" title=" line graphs"> line graphs</a>, <a href="https://publications.waset.org/abstracts/search?q=matching%20number" title=" matching number"> matching number</a> </p> <a href="https://publications.waset.org/abstracts/99652/improvement-a-lower-bound-of-energy-for-some-family-of-graphs-related-to-determinant-of-adjacency-matrix" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/99652.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">232</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">343</span> Upper Bounds on the Paired Domination Number of Cubic Graphs</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Bin%20Sheng">Bin Sheng</a>, <a href="https://publications.waset.org/abstracts/search?q=Changhong%20Lu"> Changhong Lu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Let G be a simple undirected graph with no isolated vertex. A paired dominating set of G is a dominating set which induces a subgraph that has a perfect matching. The paired domination number of G, denoted by γₚᵣ(G), is the size of its smallest paired dominating set. Goddard and Henning conjectured that γₚᵣ(G) ≤ 4n/7 holds for every graph G with δ(G) ≥ 3, except the Petersen Graph. In this paper, we prove this conjecture for cubic graphs. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=paired%20dominating%20set" title="paired dominating set">paired dominating set</a>, <a href="https://publications.waset.org/abstracts/search?q=upper%20bound" title=" upper bound"> upper bound</a>, <a href="https://publications.waset.org/abstracts/search?q=cubic%20graphs" title=" cubic graphs"> cubic graphs</a>, <a href="https://publications.waset.org/abstracts/search?q=weight%20function" title=" weight function"> weight function</a> </p> <a href="https://publications.waset.org/abstracts/136021/upper-bounds-on-the-paired-domination-number-of-cubic-graphs" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/136021.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">240</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">342</span> Marriage Domination and Divorce Domination in Graphs</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mark%20L.%20Caay">Mark L. Caay</a>, <a href="https://publications.waset.org/abstracts/search?q=Rodolfo%20E.%20Maza"> Rodolfo E. Maza</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, the authors define two new variants of domination in graphs: the marriage and the divorce domination. A subset S ⊆ V (G) is said to be a marriage dominating set of G if for every e ∈ E(G), there exists a u ∈ V (G) such that u is one of the end vertex of e. A marriage dominating set S ⊆ V (G) is said to be a divorce dominating set of G if G\S is a disconnected graph. In this study, the authors present conditions of graphs for which the marriage and the divorce domination will take place and for which the two sets will coincide. Furthermore, the author gives the necessary and sufficient conditions for marriage domination to avoid divorce. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=domination" title="domination">domination</a>, <a href="https://publications.waset.org/abstracts/search?q=decomposition" title=" decomposition"> decomposition</a>, <a href="https://publications.waset.org/abstracts/search?q=marriage%20domination" title=" marriage domination"> marriage domination</a>, <a href="https://publications.waset.org/abstracts/search?q=divorce%20domination" title=" divorce domination"> divorce domination</a>, <a href="https://publications.waset.org/abstracts/search?q=marriage%20theorem" title=" marriage theorem"> marriage theorem</a> </p> <a href="https://publications.waset.org/abstracts/192228/marriage-domination-and-divorce-domination-in-graphs" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/192228.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">17</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">341</span> Graph Similarity: Algebraic Model and Its Application to Nonuniform Signal Processing</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Nileshkumar%20Vishnav">Nileshkumar Vishnav</a>, <a href="https://publications.waset.org/abstracts/search?q=Aditya%20Tatu"> Aditya Tatu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A recent approach of representing graph signals and graph filters as polynomials is useful for graph signal processing. In this approach, the adjacency matrix plays pivotal role; instead of the more common approach involving graph-Laplacian. In this work, we follow the adjacency matrix based approach and corresponding algebraic signal model. We further expand the theory and introduce the concept of similarity of two graphs. The similarity of graphs is useful in that key properties (such as filter-response, algebra related to graph) get transferred from one graph to another. We demonstrate potential applications of the relation between two similar graphs, such as nonuniform filter design, DTMF detection and signal reconstruction. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=graph%20signal%20processing" title="graph signal processing">graph signal processing</a>, <a href="https://publications.waset.org/abstracts/search?q=algebraic%20signal%20processing" title=" algebraic signal processing"> algebraic signal processing</a>, <a href="https://publications.waset.org/abstracts/search?q=graph%20similarity" title=" graph similarity"> graph similarity</a>, <a href="https://publications.waset.org/abstracts/search?q=isospectral%20graphs" title=" isospectral graphs"> isospectral graphs</a>, <a href="https://publications.waset.org/abstracts/search?q=nonuniform%20signal%20processing" title=" nonuniform signal processing"> nonuniform signal processing</a> </p> <a href="https://publications.waset.org/abstracts/59404/graph-similarity-algebraic-model-and-its-application-to-nonuniform-signal-processing" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/59404.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">352</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">340</span> Hosoya Polynomials of Zero-Divisor Graphs</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Abdul%20Jalil%20M.%20Khalaf">Abdul Jalil M. Khalaf</a>, <a href="https://publications.waset.org/abstracts/search?q=Esraa%20M.%20Kadhim"> Esraa M. Kadhim</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The Hosoya polynomial of a graph G is a graphical invariant polynomial that its first derivative at x= 1 is equal to the Wiener index and second derivative at x=1 is equal to the Hyper-Wiener index. In this paper we study the Hosoya polynomial of zero-divisor graphs. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hosoya%20polynomial" title="Hosoya polynomial">Hosoya polynomial</a>, <a href="https://publications.waset.org/abstracts/search?q=wiener%20index" title=" wiener index"> wiener index</a>, <a href="https://publications.waset.org/abstracts/search?q=Hyper-Wiener%20index" title=" Hyper-Wiener index"> Hyper-Wiener index</a>, <a href="https://publications.waset.org/abstracts/search?q=zero-divisor%20graphs" title=" zero-divisor graphs"> zero-divisor graphs</a> </p> <a href="https://publications.waset.org/abstracts/27159/hosoya-polynomials-of-zero-divisor-graphs" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/27159.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">530</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">339</span> The K-Distance Neighborhood Polynomial of a Graph</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Soner%20Nandappa%20D.">Soner Nandappa D.</a>, <a href="https://publications.waset.org/abstracts/search?q=Ahmed%20Mohammed%20Naji"> Ahmed Mohammed Naji</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In a graph G = (V, E), the distance from a vertex v to a vertex u is the length of shortest v to u path. The eccentricity e(v) of v is the distance to a farthest vertex from v. The diameter diam(G) is the maximum eccentricity. The k-distance neighborhood of v, for 0 ≤ k ≤ e(v), is Nk(v) = {u ϵ V (G) : d(v, u) = k}. In this paper, we introduce a new distance degree based topological polynomial of a graph G is called a k- distance neighborhood polynomial, denoted Nk(G, x). It is a polynomial with the coefficient of the term k, for 0 ≤ k ≤ e(v), is the sum of the cardinalities of Nk(v) for every v ϵ V (G). Some properties of k- distance neighborhood polynomials are obtained. Exact formulas of the k- distance neighborhood polynomial for some well-known graphs, Cartesian product and join of graphs are presented. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=vertex%20degrees" title="vertex degrees">vertex degrees</a>, <a href="https://publications.waset.org/abstracts/search?q=distance%20in%20graphs" title=" distance in graphs"> distance in graphs</a>, <a href="https://publications.waset.org/abstracts/search?q=graph%20operation" title=" graph operation"> graph operation</a>, <a href="https://publications.waset.org/abstracts/search?q=Nk-polynomials" title=" Nk-polynomials"> Nk-polynomials</a> </p> <a href="https://publications.waset.org/abstracts/52946/the-k-distance-neighborhood-polynomial-of-a-graph" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/52946.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">549</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">338</span> Surface to the Deeper: A Universal Entity Alignment Approach Focusing on Surface Information</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Zheng%20Baichuan">Zheng Baichuan</a>, <a href="https://publications.waset.org/abstracts/search?q=Li%20Shenghui"> Li Shenghui</a>, <a href="https://publications.waset.org/abstracts/search?q=Li%20Bingqian"> Li Bingqian</a>, <a href="https://publications.waset.org/abstracts/search?q=Zhang%20Ning"> Zhang Ning</a>, <a href="https://publications.waset.org/abstracts/search?q=Chen%20Kai"> Chen Kai</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Entity alignment (EA) tasks in knowledge graphs often play a pivotal role in the integration of knowledge graphs, where structural differences often exist between the source and target graphs, such as the presence or absence of attribute information and the types of attribute information (text, timestamps, images, etc.). However, most current research efforts are focused on improving alignment accuracy, often along with an increased reliance on specific structures -a dependency that inevitably diminishes their practical value and causes difficulties when facing knowledge graph alignment tasks with varying structures. Therefore, we propose a universal knowledge graph alignment approach that only utilizes the common basic structures shared by knowledge graphs. We have demonstrated through experiments that our method achieves state-of-the-art performance in fair comparisons. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=knowledge%20graph" title="knowledge graph">knowledge graph</a>, <a href="https://publications.waset.org/abstracts/search?q=entity%20alignment" title=" entity alignment"> entity alignment</a>, <a href="https://publications.waset.org/abstracts/search?q=transformer" title=" transformer"> transformer</a>, <a href="https://publications.waset.org/abstracts/search?q=deep%20learning" title=" deep learning"> deep learning</a> </p> <a href="https://publications.waset.org/abstracts/185816/surface-to-the-deeper-a-universal-entity-alignment-approach-focusing-on-surface-information" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/185816.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">45</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">337</span> The Analysis of Split Graphs in Social Networks Based on the k-Cardinality Assignment Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ivan%20Belik">Ivan Belik</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In terms of social networks split graphs correspond to the variety of interpersonal and intergroup relations. In this paper we analyse the interaction between the cliques (socially strong and trusty groups) and the independent sets (fragmented and non-connected groups of people) as the basic components of any split graph. Based on the Semi-Lagrangean relaxation for the k-cardinality assignment problem we show the way of how to minimize the socially risky interactions between the cliques and the independent sets within the social network. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cliques" title="cliques">cliques</a>, <a href="https://publications.waset.org/abstracts/search?q=independent%20sets" title=" independent sets"> independent sets</a>, <a href="https://publications.waset.org/abstracts/search?q=k-cardinality%20assignment" title=" k-cardinality assignment"> k-cardinality assignment</a>, <a href="https://publications.waset.org/abstracts/search?q=social%20networks" title=" social networks"> social networks</a>, <a href="https://publications.waset.org/abstracts/search?q=split%20graphs" title=" split graphs"> split graphs</a> </p> <a href="https://publications.waset.org/abstracts/15143/the-analysis-of-split-graphs-in-social-networks-based-on-the-k-cardinality-assignment-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/15143.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">320</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">336</span> Hosoya Polynomials of Mycielskian Graphs</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sanju%20Vaidya">Sanju Vaidya</a>, <a href="https://publications.waset.org/abstracts/search?q=Aihua%20Li"> Aihua Li</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Vulnerability measures and topological indices are crucial in solving various problems such as the stability of the communication networks and development of mathematical models for chemical compounds. In 1947, Harry Wiener introduced a topological index related to molecular branching. Now there are more than 100 topological indices for graphs. For example, Hosoya polynomials (also called Wiener polynomials) were introduced to derive formulas for certain vulnerability measures and topological indices for various graphs. In this paper, we will find a relation between the Hosoya polynomials of any graph and its Mycielskian graph. Additionally, using this we will compute vulnerability measures, closeness and betweenness centrality, and extended Wiener indices. It is fascinating to see how Hosoya polynomials are useful in the two diverse fields, cybersecurity and chemistry. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=hosoya%20polynomial" title="hosoya polynomial">hosoya polynomial</a>, <a href="https://publications.waset.org/abstracts/search?q=mycielskian%20graph" title=" mycielskian graph"> mycielskian graph</a>, <a href="https://publications.waset.org/abstracts/search?q=graph%20vulnerability%20measure" title=" graph vulnerability measure"> graph vulnerability measure</a>, <a href="https://publications.waset.org/abstracts/search?q=topological%20index" title=" topological index"> topological index</a> </p> <a href="https://publications.waset.org/abstracts/172528/hosoya-polynomials-of-mycielskian-graphs" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/172528.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">69</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">335</span> Location-Domination on Join of Two Graphs and Their Complements</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Analen%20Malnegro">Analen Malnegro</a>, <a href="https://publications.waset.org/abstracts/search?q=Gina%20Malacas"> Gina Malacas</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Dominating sets and related topics have been studied extensively in the past few decades. A dominating set of a graph G is a subset D of V such that every vertex not in D is adjacent to at least one member of D. The domination number γ(G) is the number of vertices in a smallest dominating set for G. Some problems involving detection devices can be modeled with graphs. Finding the minimum number of devices needed according to the type of devices and the necessity of locating the object gives rise to locating-dominating sets. A subset S of vertices of a graph G is called locating-dominating set, LD-set for short, if it is a dominating set and if every vertex v not in S is uniquely determined by the set of neighbors of v belonging to S. The location-domination number λ(G) is the minimum cardinality of an LD-set for G. The complement of a graph G is a graph Ḡ on same vertices such that two distinct vertices of Ḡ are adjacent if and only if they are not adjacent in G. An LD-set of a graph G is global if it is an LD-set of both G and its complement Ḡ. The global location-domination number λg(G) is defined as the minimum cardinality of a global LD-set of G. In this paper, global LD-sets on the join of two graphs are characterized. Global location-domination numbers of these graphs are also determined. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=dominating%20set" title="dominating set">dominating set</a>, <a href="https://publications.waset.org/abstracts/search?q=global%20locating-dominating%20set" title=" global locating-dominating set"> global locating-dominating set</a>, <a href="https://publications.waset.org/abstracts/search?q=global%20location-domination%20number" title=" global location-domination number"> global location-domination number</a>, <a href="https://publications.waset.org/abstracts/search?q=locating-dominating%20set" title=" locating-dominating set"> locating-dominating set</a>, <a href="https://publications.waset.org/abstracts/search?q=location-domination%20number" title=" location-domination number"> location-domination number</a> </p> <a href="https://publications.waset.org/abstracts/92257/location-domination-on-join-of-two-graphs-and-their-complements" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/92257.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">184</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">334</span> Improoving Readability for Tweet Contextualization Using Bipartite Graphs</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Amira%20Dhokar">Amira Dhokar</a>, <a href="https://publications.waset.org/abstracts/search?q=Lobna%20Hlaoua"> Lobna Hlaoua</a>, <a href="https://publications.waset.org/abstracts/search?q=Lotfi%20Ben%20Romdhane"> Lotfi Ben Romdhane</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Tweet contextualization (TC) is a new issue that aims to answer questions of the form 'What is this tweet about?' The idea of this task was imagined as an extension of a previous area called multi-document summarization (MDS), which consists in generating a summary from many sources. In both TC and MDS, the summary should ideally contain the most relevant information of the topic that is being discussed in the source texts (for MDS) and related to the query (for TC). Furthermore of being informative, a summary should be coherent, i.e. well written to be readable and grammatically compact. Hence, coherence is an essential characteristic in order to produce comprehensible texts. In this paper, we propose a new approach to improve readability and coherence for tweet contextualization based on bipartite graphs. The main idea of our proposed method is to reorder sentences in a given paragraph by combining most expressive words detection and HITS (Hyperlink-Induced Topic Search) algorithm to make up a coherent context. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=bipartite%20graphs" title="bipartite graphs">bipartite graphs</a>, <a href="https://publications.waset.org/abstracts/search?q=readability" title=" readability"> readability</a>, <a href="https://publications.waset.org/abstracts/search?q=summarization" title=" summarization"> summarization</a>, <a href="https://publications.waset.org/abstracts/search?q=tweet%20contextualization" title=" tweet contextualization"> tweet contextualization</a> </p> <a href="https://publications.waset.org/abstracts/87337/improoving-readability-for-tweet-contextualization-using-bipartite-graphs" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/87337.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">193</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">333</span> Graph Codes - 2D Projections of Multimedia Feature Graphs for Fast and Effective Retrieval</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Stefan%20Wagenpfeil">Stefan Wagenpfeil</a>, <a href="https://publications.waset.org/abstracts/search?q=Felix%20Engel"> Felix Engel</a>, <a href="https://publications.waset.org/abstracts/search?q=Paul%20McKevitt"> Paul McKevitt</a>, <a href="https://publications.waset.org/abstracts/search?q=Matthias%20Hemmje"> Matthias Hemmje</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Multimedia Indexing and Retrieval is generally designed and implemented by employing feature graphs. These graphs typically contain a significant number of nodes and edges to reflect the level of detail in feature detection. A higher level of detail increases the effectiveness of the results but also leads to more complex graph structures. However, graph-traversal-based algorithms for similarity are quite inefficient and computation intensive, especially for large data structures. To deliver fast and effective retrieval, an efficient similarity algorithm, particularly for large graphs, is mandatory. Hence, in this paper, we define a graph-projection into a 2D space (Graph Code) as well as the corresponding algorithms for indexing and retrieval. We show that calculations in this space can be performed more efficiently than graph-traversals due to a simpler processing model and a high level of parallelization. In consequence, we prove that the effectiveness of retrieval also increases substantially, as Graph Codes facilitate more levels of detail in feature fusion. Thus, Graph Codes provide a significant increase in efficiency and effectiveness (especially for Multimedia indexing and retrieval) and can be applied to images, videos, audio, and text information. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=indexing" title="indexing">indexing</a>, <a href="https://publications.waset.org/abstracts/search?q=retrieval" title=" retrieval"> retrieval</a>, <a href="https://publications.waset.org/abstracts/search?q=multimedia" title=" multimedia"> multimedia</a>, <a href="https://publications.waset.org/abstracts/search?q=graph%20algorithm" title=" graph algorithm"> graph algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=graph%20code" title=" graph code"> graph code</a> </p> <a href="https://publications.waset.org/abstracts/135289/graph-codes-2d-projections-of-multimedia-feature-graphs-for-fast-and-effective-retrieval" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/135289.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">161</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">332</span> Multiple Version of Roman Domination in Graphs</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=J.%20C.%20Valenzuela-Tripodoro">J. C. Valenzuela-Tripodoro</a>, <a href="https://publications.waset.org/abstracts/search?q=P.%20%C3%81lvarez-Ru%C3%ADz"> P. Álvarez-Ruíz</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20A.%20Mateos-Camacho"> M. A. Mateos-Camacho</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20Cera"> M. Cera</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In 2004, it was introduced the concept of Roman domination in graphs. This concept was initially inspired and related to the defensive strategy of the Roman Empire. An undefended place is a city so that no legions are established on it, whereas a strong place is a city in which two legions are deployed. This situation may be modeled by labeling the vertices of a finite simple graph with labels {0, 1, 2}, satisfying the condition that any 0-vertex must be adjacent to, at least, a 2-vertex. Roman domination in graphs is a variant of classic domination. Clearly, the main aim is to obtain such labeling of the vertices of the graph with minimum cost, that is to say, having minimum weight (sum of all vertex labels). Formally, a function f: V (G) → {0, 1, 2} is a Roman dominating function (RDF) in the graph G = (V, E) if f(u) = 0 implies that f(v) = 2 for, at least, a vertex v which is adjacent to u. The weight of an RDF is the positive integer w(f)= ∑_(v∈V)▒〖f(v)〗. The Roman domination number, γ_R (G), is the minimum weight among all the Roman dominating functions? Obviously, the set of vertices with a positive label under an RDF f is a dominating set in the graph, and hence γ(G)≤γ_R (G). In this work, we start the study of a generalization of RDF in which we consider that any undefended place should be defended from a sudden attack by, at least, k legions. These legions can be deployed in the city or in any of its neighbours. A function f: V → {0, 1, . . . , k + 1} such that f(N[u]) ≥ k + |AN(u)| for all vertex u with f(u) < k, where AN(u) represents the set of active neighbours (i.e., with a positive label) of vertex u, is called a [k]-multiple Roman dominating functions and it is denoted by [k]-MRDF. The minimum weight of a [k]-MRDF in the graph G is the [k]-multiple Roman domination number ([k]-MRDN) of G, denoted by γ_[kR] (G). First, we prove that the [k]-multiple Roman domination decision problem is NP-complete even when restricted to bipartite and chordal graphs. A problem that had been resolved for other variants and wanted to be generalized. We know the difficulty of calculating the exact value of the [k]-MRD number, even for families of particular graphs. Here, we present several upper and lower bounds for the [k]-MRD number that permits us to estimate it with as much precision as possible. Finally, some graphs with the exact value of this parameter are characterized. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=multiple%20roman%20domination%20function" title="multiple roman domination function">multiple roman domination function</a>, <a href="https://publications.waset.org/abstracts/search?q=decision%20problem%20np-complete" title=" decision problem np-complete"> decision problem np-complete</a>, <a href="https://publications.waset.org/abstracts/search?q=bounds" title=" bounds"> bounds</a>, <a href="https://publications.waset.org/abstracts/search?q=exact%20values" title=" exact values"> exact values</a> </p> <a href="https://publications.waset.org/abstracts/163297/multiple-version-of-roman-domination-in-graphs" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/163297.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">108</span> </span> </div> </div> <ul class="pagination"> <li class="page-item disabled"><span class="page-link">&lsaquo;</span></li> <li class="page-item active"><span class="page-link">1</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=subdivision%20graphs&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=subdivision%20graphs&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=subdivision%20graphs&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=subdivision%20graphs&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=subdivision%20graphs&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=subdivision%20graphs&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=subdivision%20graphs&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=subdivision%20graphs&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=subdivision%20graphs&page=10">10</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=subdivision%20graphs&page=11">11</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=subdivision%20graphs&page=12">12</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=subdivision%20graphs&page=13">13</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=subdivision%20graphs&page=2" rel="next">&rsaquo;</a></li> </ul> </div> </main> <footer> <div id="infolinks" class="pt-3 pb-2"> <div class="container"> <div style="background-color:#f5f5f5;" class="p-3"> <div class="row"> <div class="col-md-2"> <ul class="list-unstyled"> About <li><a href="https://waset.org/page/support">About Us</a></li> <li><a href="https://waset.org/page/support#legal-information">Legal</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/WASET-16th-foundational-anniversary.pdf">WASET celebrates its 16th foundational anniversary</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Account <li><a href="https://waset.org/profile">My Account</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Explore <li><a href="https://waset.org/disciplines">Disciplines</a></li> <li><a href="https://waset.org/conferences">Conferences</a></li> <li><a href="https://waset.org/conference-programs">Conference Program</a></li> <li><a href="https://waset.org/committees">Committees</a></li> <li><a href="https://publications.waset.org">Publications</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Research <li><a href="https://publications.waset.org/abstracts">Abstracts</a></li> <li><a href="https://publications.waset.org">Periodicals</a></li> <li><a href="https://publications.waset.org/archive">Archive</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Open Science <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Philosophy.pdf">Open Science Philosophy</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Award.pdf">Open Science Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Society-Open-Science-and-Open-Innovation.pdf">Open Innovation</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Postdoctoral-Fellowship-Award.pdf">Postdoctoral Fellowship Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Scholarly-Research-Review.pdf">Scholarly Research Review</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Support <li><a href="https://waset.org/page/support">Support</a></li> <li><a href="https://waset.org/profile/messages/create">Contact Us</a></li> <li><a href="https://waset.org/profile/messages/create">Report Abuse</a></li> </ul> </div> </div> </div> </div> </div> <div class="container text-center"> <hr style="margin-top:0;margin-bottom:.3rem;"> <a href="https://creativecommons.org/licenses/by/4.0/" target="_blank" class="text-muted small">Creative Commons Attribution 4.0 International License</a> <div id="copy" class="mt-2">© 2024 World Academy of Science, Engineering and Technology</div> </div> </footer> <a href="javascript:" id="return-to-top"><i class="fas fa-arrow-up"></i></a> <div class="modal" id="modal-template"> <div class="modal-dialog"> <div class="modal-content"> <div class="row m-0 mt-1"> <div class="col-md-12"> <button type="button" class="close" data-dismiss="modal" aria-label="Close"><span aria-hidden="true">×</span></button> </div> </div> <div class="modal-body"></div> </div> </div> </div> <script src="https://cdn.waset.org/static/plugins/jquery-3.3.1.min.js"></script> <script src="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/js/bootstrap.bundle.min.js"></script> <script src="https://cdn.waset.org/static/js/site.js?v=150220211556"></script> <script> jQuery(document).ready(function() { /*jQuery.get("https://publications.waset.org/xhr/user-menu", function (response) { jQuery('#mainNavMenu').append(response); });*/ jQuery.get({ url: "https://publications.waset.org/xhr/user-menu", cache: false }).then(function(response){ jQuery('#mainNavMenu').append(response); }); }); </script> </body> </html>